export function quickSort (arr: number[]): number[] {
const length = arr.length;
if (length === 0) {
return arr;
}
const midIndex = Math.floor(length / 2);
const midValue = arr[midIndex];
const left: number[] = [];
const right: number[] = [];
for (let i = 0; i < length; i++) {
if (i === midIndex) {
continue;
}
if (arr[i] < midValue) {
left.push(arr[i])
}
if (arr[i] > midValue) {
right.push(arr[i])
}
}
return quickSort(left).concat([midValue], quickSort(right))
}