/**
 * Sort an array of numbers in-place and in ascending order.
 * Partitioning is done by choosing a random element as the pivot.
 *
 * Time complexity: O(n*log(n)) on average, where n is the number of elements to sort
 *
 * Space complexity: O(log(n)) for recursion stack
 *
 * @param arr - array of numbers to be sorted
 * @param left - Optional: index of left bound
 * @param right - Optional: index of right bound
 */
declare const quickSort: (arr: number[], left?: number, right?: number) => void;
export default quickSort;
//# sourceMappingURL=quick-sort.d.ts.map