MCPcopy Create free account
hub / github.com/course-dasheng/fe-algorithm / quickSort1

Function quickSort1

sort/sort.js:80–87  ·  view source on GitHub ↗
(arr,start,end)

Source from the content-addressed store, hash-verified

78 return start
79}
80function quickSort1(arr,start,end){
81 if(start<end){
82 let index = quick1(arr,start,end) //标志位的值
83 quickSort1(arr,start,index-1)
84 quickSort1(arr,index,end)
85 }
86 return arr
87}
88
89console.log('原地快速排序',quickSort1(arrary,0,arrary.length-1))
90

Callers 1

sort.jsFile · 0.85

Calls 1

quick1Function · 0.85

Tested by

no test coverage detected