Quick Sort

Moderate
0/80
Average time to solve is 10m
profile
Contributed by
205 upvotes
Asked in companies
FreshworksSamsung R&D InstituteLenskart

Problem statement

You are given an array of integers. You need to sort the array in ascending order using quick sort.

Quick sort is a divide and conquer algorithm in which we choose a pivot point and partition the array into two parts i.e, left and right. The left part contains the numbers smaller than the pivot element and the right part contains the numbers larger than the pivot element. Then we recursively sort the left and right parts of the array.

Example:

Let the array = [ 4, 2, 1, 5, 3 ]
Let pivot to be the rightmost number.

example

After the 1st level partitioning the array will be { 2, 1, 3, 4, 5 } as 3 was the pivot. After 2nd level partitioning the array will be { 1, 2, 3, 4, 5 } as 1 was the pivot for the left part and 5 was the pivot for the right part. Now our array is sorted and there is no need to divide it again.

Detailed explanation ( Input/output format, Notes, Images )
Input format: 
The first line of input contains an integer 'T' denoting the number of queries or test cases. 

The first line of each input consists of an integer 'N' denoting the size of the array.

The second line of each input consists of 'N' space-separated integers denoting the elements of the array.
Output format: 
For each test case, print a single line containing space-separated integers denoting the elements of the array after sorting.

The output of each test case will be printed in a separate line.
Note: 
You do not need to print anything, it has already been taken care of. Just implement the given function.
Follow Up 
Can you solve this in the worst case NlogN complexity?
Constraints: 
1 <= T <= 10
1 <= N <= 10 ^ 3
-10 ^ 9 <= ARR[i] <= 10 ^ 9

Where 'T' is the number of test cases, 'N' is the length of the array 'ARR', and 'ARR[i]' is the array element at index i.

Time limit: 1 sec.
Sample Input 1:
2
5
4 2 5 1 3
4     
6 2 4 1
Sample Output 1:
1 2 3 4 5
1 2 4 6
Explanation of Input 1:
Test case 1:
Given array =  [4, 2, 5, 1, 3]
Sorted array = [1, 2, 3, 4, 5]

Test case 2:
Given array =  [6, 2, 4, 1]
Sorted array = [1, 2, 4, 6]
Sample Input 2:
2
5 
5 3 2 6 4
4
1 2 3 4
Sample Output 2:
2 3 4 5 6
1 2 3 4
Hint

The first approach will be picking edge elements as pivot.

Approaches (3)
Right most pivot

The first approach will be picking edge elements as pivot.

What needs to be done:

  • Pick the rightmost element as pivot.
  • Partition the array with numbers smaller than pivot on the left of pivot and numbers larger than pivot on the right of the pivot.
  • Recursively sort both left and right partition.
Time Complexity

O(N ^ 2), where ‘N’ is the size of the array.

 

In the worst case, the pivot element will be the largest or smallest element and will make a partition of size (N - 1).

Space Complexity

O(N), where ‘N’ is the size of the array.

 

In the worst case, we are creating a recursive stack of size ‘N’.

Code Solution
(100% EXP penalty)
Quick Sort
Full screen
Console