Checkout
Start free trial
Take Naologic for a spin today, no credit card needed and no obligations.
Start free trial
Question

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

Answer

In terms of best asymptotic runtime complexity, Insertion Sort and Heap Sort stand out because their best case runtime complexity is O(n). However, when considering average case best asymptotic runtime complexity, it's O(nlogn) which is offered by Merge Sort, Quick Sort, and Heap Sort.