Question

Which is the best sorting algorithm in runtime complexity?

Answer 1

Answer:

because their best case run time complexity is - O(n). However, average case best asymptotic run time complexity is O(nlogn) which is given by- Merge Sort, Quick Sort, Heap Sort. The worst case best run time complexity is O(nlogn) which is given by -Merge Sort and Heap Sort.For Best case Insertion Sort and Heap Sort are the Best one as their best case run time complexity is O(n). For average case best asymptotic run time complexity is O(nlogn) which is given by Merge Sort, Heap Sort, Quick Sort. For Worst Case best run time complexity is O(nlogn) which is given by Merge Sort, Heap Sort

Answer 2

Worst Case best run time complexity is O(nlogn) which is given by Merge Sort, Heap Sort

Hooe it helps u❤☺