Question

8 Sorting Algorithms:

Bubble, selection, insertion, quick, merge, bucket, radix, counting.

1. A..Which of the above sorting algorithms does TimSort use?

2. Which of the above algorithms sort a REVERSE ORDER list in O(n2 ) (worst case)?

3. Which of the above algorithms sort a REVERSE ORDER list in O(nlogn) (worst case)?

4. Which of the above algorithms sort an ordered list , a reverse ordered list, and a random list (all three) in 0(nlogn) (worst case)?

5. Which of the above algorithms sort an ordered list , a reverse ordered list, and a random list (all three) in 0(n2 )(worst case)?

6. Which algorithm takes almost double the amount of space of the original list while it is sorting?

7. Which of the 3 traversal methods would we use to print out a binary search tree as sorted?

Answer 1

1) Timsort is a hybrid stable sorting technique which derived from merge sort and insertion sort

2) Bubble, selection, insertion, quick, bucket

3) Merge Sort

4) Merge Sort in all way it take O(nlongn)

5) Selection Sort take O(n2) in all cases

6) counting sort almost take double space O(n+k) where n is size and k is range

7)Merge sort, bucket , Quick