Quick Sort Implementation

Objective: Write an algorithm to sort an array in increasing or decreasing order using Quick Sort.

Input:  An Array arrA[]

Output: A sorted array.

Approach:

• Choose any element from the array and call it as pivot element, Example here we have selected middle element as pivot
• Place all the elements smaller than pivot in the left side of pivot.
• Place all the elements greater than pivot in the right side of pivot.
• Sort left side and right side recursively.

Example:

Run This Code

Code:

Output:

UnSorted : 2 1 8 4 0 9 3 11
Quick Sorted : 0 1 2 3 4 8 9 11

Also Read:

- Stable Marriage Problem - Gale–Shapley Algorithm - Java Hard
- Print All Paths From Root In a Binary Tree Whose Sum is Equal to a Given Number Medium
- Sort a given stack - Using Recursion Hard
- Find Election Winner Beginner
- Maximizing Contiguous Ones with a Single Flip in a Binary Array Medium
- Print All The Nodes Which are X distance from the Given Node Hard
- Reverse the given Array without using built in function Beginner
- Print All The Nodes Which are X distance from the Root Medium