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:

- Swap Every Kth Node in a LinkedList Medium
- In a number, add digits until it becomes a single digit Beginner
- Find first two largest elements in a given array Beginner
- Inorder Successor in Binary Search Tree without Using Parent link Hard
- Inorder Successor in Binary Tree Medium
- Tree Traversals Beginner
- Find if any two intervals overlap in given intervals Medium
- Stable Marriage Problem - Gale–Shapley Algorithm - Java Hard