> For the complete documentation index, see [llms.txt](https://ondrej-kvasnovsky-2.gitbook.io/algorithms/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://ondrej-kvasnovsky-2.gitbook.io/algorithms/sorting/quicksort.md).

# Quicksort

[Here](https://www.youtube.com/watch?v=ZHVk2blR45Q) is a very good explanation of quick sort by Rob Edwards from SDSU.

Is `O(n log n)` complexity. Is not stable but can be done in-place. In worst case, it is `O(n^2)`.

## Solution

Here is an implementation, similar to the one from the video.

```
package sorting;

import java.util.Arrays;

public class QuickSortRobEdwards {

    public static void main(String[] args) {
        int[] array = {6, 5, 4, 3, 2, 1};
        sort(array);
        System.out.println(Arrays.toString(array));
    }

    public static void sort(int[] array) {
        quicksort(array, 0, array.length - 1);
    }

    public static void quicksort(int[] array, int from, int to) {
        if (from >= to) return; // single element list is already sorted

        int pivotPointValue = array[to];
        int firsIndexThatIsLargeThanPivotPoint = from;
        for (int i = from; i < to; i++) {
            if (array[i] < pivotPointValue) {
                swap(array, i, firsIndexThatIsLargeThanPivotPoint);
                firsIndexThatIsLargeThanPivotPoint++;
            }
        }
        swap(array, firsIndexThatIsLargeThanPivotPoint, to);
        quicksort(array, from, firsIndexThatIsLargeThanPivotPoint - 1);
        quicksort(array, firsIndexThatIsLargeThanPivotPoint + 1, to);
    }

    public static void swap(int[] array, int from, int to) {
        int temp = array[from];
        array[from] = array[to];
        array[to] = temp;
    }
}
```