You are viewing a single comment's thread. Return to all comments →
which sort is best? insertion?
Best sort asymptotically is Merge Sort, with a Big O(nlogn). Insertion has a Big O (n^2) which is far worse when dealing with large data sets.
we need swap.. using merge is it pssible
Minimum Absolute Difference in an Array
You are viewing a single comment's thread. Return to all comments →
which sort is best? insertion?
Best sort asymptotically is Merge Sort, with a Big O(nlogn). Insertion has a Big O (n^2) which is far worse when dealing with large data sets.
we need swap.. using merge is it pssible