What is the advantage of library sort over insertion sort

Home / Data Structure / Sorting Algorithms / Question

Examveda

What is the advantage of library sort over insertion sort?

A. Library sort has a better average time complexity

B. Library sort has a better space complexity

C. Library sort has better best case time complexity

D. Library has better worst case time complexity

Answer: Option A

This Question Belongs to Data Structure >> Sorting Algorithms

Related Questions on Sorting Algorithms

A. O(n log n)

B. O(n)

C. O(n²)

D. O(n³)

View Answer

A. Insertion Sort

B. Quick Sort

C. Selection Sort

D. Insertion Sort

View Answer

A. O(n²)

B. O(1)

C. O(n)

D. O(log n)

View Answer

A. Merge Sort

B. Heap Sort

C. Counting Sort

D. Quick Sort

View Answer