Minimum Absolute Difference in an Array

  • + 1 comment

    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.