algorithmpool
Version:
A pool of algorithms and data-structures for geeks
11 lines (9 loc) • 681 B
JavaScript
// export const sortedArr = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20];
// export const reverseArr = [20, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1];
// export const notSortedArr = [15, 8, 5, 12, 10, 1, 16, 9, 11, 7, 20, 3, 2, 6, 17, 18, 4, 13, 14, 19];
// export const equalArr = [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1];
// export const negativeArr = [-1, 0, 5, -10, 20, 13, -7, 3, 2, -3];
// export const negativeArrSorted = [-10, -7, -3, -1, 0, 2, 3, 5, 13, 20];
import { quickSort } from '../../index';
import { testSortAlgorithm } from './sort-algo-tests';
testSortAlgorithm(quickSort, 'Quick Sort');