import type { CompareFunction } from "../types/array/compareFunction";
/**
 * Sorts an array using a hybrid algorithm combining QuickSort and InsertionSort
 * @param {T[]} array Array to sort
 * @param {CompareFunction<T>} compareFunction Comparison function that returns negative if a < b, zero if a = b, positive if a > b
 * @param {number} startIndex Starting index for the sort range (default: 0)
 * @param {number} endIndex Ending index for the sort range (default: array.length - 1)
 * @param {number} insertionSortThreshold Threshold for switching to insertion sort (default: 10)
 * @returns {T[]} Sorted array
 * @example
 * quickSort([1, 3, 2, 4, 5]); // [1, 2, 3, 4, 5]
 * quickSort([1, 3, 2], (a, b) => b - a); // [3, 2, 1]
 * quickSort(['b', 'a', 'c']); // ['a', 'b', 'c']
 */
export declare const quickSort: <T>(array: T[], compareFunction?: CompareFunction<T>, startIndex?: number, endIndex?: number, insertionSortThreshold?: number) => T[];