/**
 * Sort an array of numbers in-place and in ascending order using top-down merge sort.
 * A subarray of arr can be sorted by specifying its left and right bounds.
 *
 * Time complexity: O(n*log(n)), where n is the number of elements to sort
 *
 * Space complexity: O(n)
 *
 * @param arr - array of numbers to sort
 * @param left - Optional: index of left bound
 * @param right - Optional: index of right bound
 */
declare const mergeSort: (arr: number[], left?: number, right?: number) => void;
export default mergeSort;
//# sourceMappingURL=merge-sort.d.ts.map