Explain the quick sort algorithm. Evaluate complexity with suitable example.

4.6kviews

written 7.9 years ago by

satishmanje93 • 250

modified 3.9 years ago by

sagarkolekar ★ 11k

analysis of algorithms

ADD COMMENT EDIT

1 Answer

93views

written 3.9 years ago by

Krishna_Agrawal • 2.7k

Quick Sort : -

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, say pivot, based on which the partition is …

Create a free account to keep reading this post.

and 4 others joined a min ago.

ADD COMMENT EDIT

Please log in to add an answer.