algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-07-05 21:19:41 +08:00
Code Issues Packages Projects Releases Wiki Activity

fix(JS, TS): chapter_sorting QuickSortMedian and QuickSortTailCall example (#785)

Browse Source
This commit is contained in:
Reese Wellin
2023-09-24 01:14:28 -07:00
committed by GitHub
parent 29c5ff4a8f
commit a6a1036dc9
2 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
codes/javascript/chapter_sorting/quick_sort.js
View File

@ -148,12 +148,12 @@ console.log('快速排序完成后 nums =', nums);
/* 快速排序（中位基准数优化） */ /* 快速排序（中位基准数优化） */
const nums1 = [2, 4, 1, 0, 3, 5]; const nums1 = [2, 4, 1, 0, 3, 5];
const quickSortMedian = new QuickSort(); const quickSortMedian = new QuickSortMedian();
quickSortMedian.quickSort(nums1, 0, nums1.length - 1); quickSortMedian.quickSort(nums1, 0, nums1.length - 1);
console.log('快速排序（中位基准数优化）完成后 nums =', nums1); console.log('快速排序（中位基准数优化）完成后 nums =', nums1);
/* 快速排序（尾递归优化） */ /* 快速排序（尾递归优化） */
const nums2 = [2, 4, 1, 0, 3, 5]; const nums2 = [2, 4, 1, 0, 3, 5];
const quickSortTailCall = new QuickSort(); const quickSortTailCall = new QuickSortTailCall();
quickSortTailCall.quickSort(nums2, 0, nums2.length - 1); quickSortTailCall.quickSort(nums2, 0, nums2.length - 1);
console.log('快速排序（尾递归优化）完成后 nums =', nums2); console.log('快速排序（尾递归优化）完成后 nums =', nums2);

4
codes/typescript/chapter_sorting/quick_sort.ts
View File

@ -170,13 +170,13 @@ console.log('快速排序完成后 nums =', nums);
/* 快速排序（中位基准数优化） */ /* 快速排序（中位基准数优化） */
const nums1 = [2, 4, 1, 0, 3, 5]; const nums1 = [2, 4, 1, 0, 3, 5];
const quickSortMedian = new QuickSort(); const quickSortMedian = new QuickSortMedian();
quickSortMedian.quickSort(nums1, 0, nums1.length - 1); quickSortMedian.quickSort(nums1, 0, nums1.length - 1);
console.log('快速排序（中位基准数优化）完成后 nums =', nums1); console.log('快速排序（中位基准数优化）完成后 nums =', nums1);
/* 快速排序（尾递归优化） */ /* 快速排序（尾递归优化） */
const nums2 = [2, 4, 1, 0, 3, 5]; const nums2 = [2, 4, 1, 0, 3, 5];
const quickSortTailCall = new QuickSort(); const quickSortTailCall = new QuickSortTailCall();
quickSortTailCall.quickSort(nums2, 0, nums2.length - 1); quickSortTailCall.quickSort(nums2, 0, nums2.length - 1);
console.log('快速排序（尾递归优化）完成后 nums =', nums2); console.log('快速排序（尾递归优化）完成后 nums =', nums2);