What is the time complexity of quick sort - Wikitechy https://www.wikitechy.com/interview-questions/tag/what-is-the-time-complexity-of-quick-sort/ Interview Questions Mon, 13 Sep 2021 10:34:33 +0000 en-US hourly 1 https://wordpress.org/?v=6.9.4 https://www.wikitechy.com/interview-questions/wp-content/uploads/2025/10/cropped-wikitechy-icon-32x32.png What is the time complexity of quick sort - Wikitechy https://www.wikitechy.com/interview-questions/tag/what-is-the-time-complexity-of-quick-sort/ 32 32 In case of the worst timing, which might be the worst to implement in sorting algorithm ? https://www.wikitechy.com/interview-questions/data-structure/in-case-of-the-worst-timing-which-might-be-the-worst-to-implement-in-sorting-algorithm/ https://www.wikitechy.com/interview-questions/data-structure/in-case-of-the-worst-timing-which-might-be-the-worst-to-implement-in-sorting-algorithm/#respond Tue, 13 Jul 2021 10:52:07 +0000 https://www.wikitechy.com/interview-questions/?p=464

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

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.

]]> https://www.wikitechy.com/interview-questions/data-structure/in-case-of-the-worst-timing-which-might-be-the-worst-to-implement-in-sorting-algorithm/feed/ 0