Asymptotic Computational Complexity - What is the best asymptotic runtime complexity?

Answer

Due to their O(n) best-case runtime complexity, Insertion Sort and Heap Sort stand out when considering best-asymptotic runtime complexity. The average case best asymptotic runtime complexity is O(nlogn), yet Merge Sort, Quick Sort, and Heap Sort all provide this.