Contents

- What is an external sorting algorithm?
- What will be the worst case and best complexity of quick sort?
- What is the best average and worst case of merge sort?
- What is the best case of quick sort?
- How many passes are required to sort a file of size n by bubble sort method?
- What is the order of quick sort in the worst case?
- Why is quicksort faster than heapsort?
- What is the best case time complexity of merge sort?
- Is Big O average or worst case?
- Is Quicksort faster than bubble sort?
- Is merge sort the best?
- Which notation is used in worst case?
- Why is Big O important?
- Is merge sort better than quick?
- Why is quicksort preferred over merge sort?
- What is the advantage of bubble sort over other sorting techniques?
- Which is the slowest sorting procedure?
- Is Big O the worst case?

## What is an external sorting algorithm?

.