sorting

Question

15 randomly generated numbers can be sorted preferably by:

heap sort 

insertion sort 

bubble sort

Answer 1

-Bubble sort time complexity is O(n²)

-Insertion sort worst case time complexity=O(n²) best case time complexity=O(n)

in insertion sort best case is possible only when most of the elements are already sorted.

-Quicksort best case and average case time complexity=O(nlogn)    worst case time complexity=O(n²)

If the randomly generated numbers in any case are already sorted then the time taken by quick sort will be O(n²)

-but heap sort will always give a  running time of O(nlogn) so heap sort should be used
 

Comments

I think ans should be - Insertion sort.

---

why insertion sort ?