<span>function <span>quickSort (arr) {<br> <span>if (arr.length <span>< <span>2) <span>return arr<br> <span>var middle <span>= Math.<span>floor(arr.length <span>/ <span>2)<br> <span>var flag <span>= arr.<span>splice(middle, <span>1)[<span>0]<br> <span>var left <span>= [],<br> right <span>= []<br> <span>for (<span>var i <span>= <span>0; i <span>< arr.length; i<span>++) {<br> <span>if (arr[i] <span>< flag) {<br> left.<span>push(arr[i])<br> } <span>else {<br> right.<span>push(arr[i])<br> }<br> }<br> <span>return <span>quickSort(left).<span>concat([flag], <span>quickSort(right))<br>}</span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span>
Java Program!
Original: https://www.cnblogs.com/programb/p/14068857.html
Author: 咔啡
Title: 快速排序？
原创文章受到原创版权保护。转载请注明出处：https://www.johngo689.com/553012/
转载文章受原作者版权保护。转载请注明原作者出处！