You are viewing a single comment's thread. Return to all comments →
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.
Seems like cookies are disabled on this browser, please enable them to open this website
Minimum Absolute Difference in an Array
You are viewing a single comment's thread. Return to all comments →
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.