Quick Sort

Quick sort is a divide-and-conquer algorithm that was invented by Tony Hoare in 1960. It is a comparison-based sorting algorithm that is known for its efficiency. Quick sort is an unstable sorting algorithm, which means that it does not preserve the relative order of equal elements in the sorted output. It is also an efficient sorting algorithm, with a time complexity of O(n log n) in the average case.

Usage

import { quickSort } from "dsacjs";

const arr = [5, 2, 9, 3, 5, 7, 1, 8, 6];

quickSort(arr); // [1, 2, 3, 5, 5, 6, 7, 8, 9]

Arguments

The function quickSort takes the following arguments:

• arr (type: Array): An array of elements to be sorted.
• compareFn (type: Function, optional): A function that defines an alternative sort order.

Example

import { quickSort } from "dsacjs";

const arr = ["banana", "apple", "orange", "mango"];

quickSort(arr, (a, b) => a.localeCompare(b)); // ["apple", "banana", "mango", "orange"]

Complexity

• Time complexity: O(n log n)

References

• Wikipedia