which is more efficient sorting algorithm?
On: November 7, 2012 Posted in Engineering Questions Comments: 4 Views: 55 data structures which is more efficient sorting algorithm? Engineering Questions
Merge and Heap sort is more efficient because both are best case algorithms i.e.,O(n logn)
merge sort or insertion sort is more efficient and could potentially be faster.
Quick sort
i think itz quick sort…