Which sorting algorithm yields both same worst case and average case?
Answers
practical general sorting algorithm yields both same worst case and average case
The given question is we have to find which sorting algorithm yields both the same worst case and average case.
The sorting is the process of arranging data into meaningful order so that we can analyze it more effectively.
There are various types of sorting they are :
- Selection sort.
- Bubble sort.
- Insertion sort.
- Merge sort.
- Quick sort.
- Heap sort.
- Counting sort.
- Radix sort.
The Heap sort and merge sort is an efficient algorithm which yields both worst and average cases.
This sorting algorithm merges the like components and efficiently order them.
The quick sorting algorithm works in the least time in the worst case.
It also works on average cases, on average the algorithm takes O( n log n)
It is same for the worst case also.
# spj2
we can find similar questions through the link given below.
https://brainly.in/question/2753937?referrer=searchResults