yigencong/algorighm
yigencong/algorighm
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

refactor： 添加非递归的快速排序测试

Browse Source
This commit is contained in:
LouisFonda 2024-02-26 23:41:16 +08:00
parent 65ae51a5c6
commit 7f8d1e0a0e
1 changed files with 3 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
sort/test.mjs
View File

@ -3,7 +3,7 @@ import { shellSort } from "./shell-sort.mjs";
import {insertionSort } from "./insertion-sort.mjs" import {insertionSort } from "./insertion-sort.mjs"
import { bubbleSort } from "./bubble-sort.mjs" import { bubbleSort } from "./bubble-sort.mjs"
import { mergeSort } from "./merge-sort.mjs"; import { mergeSort } from "./merge-sort.mjs";
import {quickSort, quickSort2, quickSort3} from "./quick-sort.mjs" import {quickSort, quickSort2, quickSort3, quickSort4, quickSort5} from "./quick-sort.mjs"
let arr = generateRandomArray(10) let arr = generateRandomArray(10)
@ -13,4 +13,5 @@ measureTime(shellSort,arr.slice())
let mergeArr = measureTime(mergeSort, arr.slice()) // 归并排序会返回一个新数组，不对原数组修改 let mergeArr = measureTime(mergeSort, arr.slice()) // 归并排序会返回一个新数组，不对原数组修改
measureTime(quickSort,arr.slice()) measureTime(quickSort,arr.slice())
measureTime(quickSort2,arr.slice()) // 挖坑法分解数组 measureTime(quickSort2,arr.slice()) // 挖坑法分解数组
measureTime(quickSort3,arr.slice()) // 挖坑法分解数组 measureTime(quickSort3,arr.slice()) // 前后指针分解数组
measureTime(quickSort4,arr) // 不使用递归处理