In case of the worst timing, which might be the worst to implement in sorting algorithm ?



In case of the worst timing, which might be the worst to implement in sorting algorithm ?

A. Quick

B. Merge

C. Time

D. Heap

Answer : A. Quick


Explanation :

  • Quick sort is a highly efficient sorting algorithm and is based on partitioning of array of data into smaller arrays.
  • A large array is partitioned into two arrays one of which holds values smaller than the specified value, approximately pivot, based on which the partition is made and another array holds values greater than the pivot value.
  • Quick sort partitions an array and then calls itself recursively twice to sort the two resulting subarrays.
Quick Sort

Quick Sort

This algorithm is quite efficient for large-sized data sets as its average and worst case complexity are of Ο(n2), where n is the number of items.


Related Searches to In case of the worst timing, which might be the worst to implement in sorting algorithm ?