Quick Sort (Hızlı Sıralama) Algorithm

Quick Sort (Fast Sorting) is a sorting algorithm developed by C.A.R. Hoare. It employs a simple and efficient method based on the “divide and conquer” strategy widely used in political science.

Algorithm begins by selecting one element from the array as the keystone (pivot). It then partitions the given array into three subarrays. All elements smaller than the pivot are moved to the first subarray (left). The second subarray consists of a single element: the pivot itself {pivot}. All elements greater than the pivot are moved to the third subarray (right). The same partitioning method is then recursively applied to the left and right subarrays until each subarray contains only one element, at which point the sorting process is complete. The algorithm is recursive.

Working Principle

Pseudocode for the Quick Sort Algorithm

Quick Sort Algorithm in Java

Animation of the Quick Sort Algorithm