GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — JavaScript/Sorts/test/QuickSortRecursive.test.js at master · TheAlgorithms/JavaScript Expand file tree/ Copy pathQuickSortRecursive.test.jsMore file actions 31 lines (28 loc) · 1.13 KB / Copy pathQuickSortRecursive.test.jsFile metadata and controls31 lines (28 loc) · 1.13 KB 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 import { quickSort } from '../QuickSortRecursive' describe('QuickSortRecursive | Partition In Place Method', () => { it('Expectedly, throw some error if we pass a non-array input', () => { expect(() => quickSort('xyz', 0, 2)).toThrow( 'Please input a valid list or array.' ) expect(() => quickSort(null, 0, 4)).toThrow( 'Please input a valid list or array.' ) expect(() => quickSort(55, 0, 2)).toThrow( 'Please input a valid list or array.' ) }) it('Expectedly, the quickSort method will sort the unsorted list in ascending order', () => { const unSortArray = [5, 9, 3, 4, 6, 2, 0, 1, 7, 8] const sortedExpectedArray = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9] expect(quickSort(unSortArray, 0, unSortArray.length - 1)).toEqual( sortedExpectedArray ) }) it('Expectedly, the quickSort method will arrange the list of character values in dictionary order.', () => { const unSortList = ['d', 'e', 'c', 'a', 'f', 'b'] const sortedExpectedList = ['a', 'b', 'c', 'd', 'e', 'f'] expect(quickSort(unSortList, 0, unSortList.length - 1)).toEqual( sortedExpectedList ) }) }) |
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |