Last active
August 29, 2015 14:02
-
-
Save zhongfox/c0ea646d63c481e4257d to your computer and use it in GitHub Desktop.
javascript quick sort
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
var rawNumbers = [4,4,3,1,8,5,13,9,2,7,18,10,4]; | |
function qsort(numbers, startIndex, endIndex) { | |
var first = startIndex, | |
last = endIndex, | |
key = numbers[first]; | |
if(first >= last) { | |
return; | |
} | |
while(first < last) { | |
while(first < last) { | |
if(numbers[last] < key) { //相等的也不移动, 或者一边移动, 不能2个都移动相等的 | |
numbers[first] = numbers[last]; | |
break; | |
} | |
last--; | |
} | |
while(first < last) { | |
if(numbers[first] > key) { // 相等的也不移动, 或者一边移动, 不能2个都移动相等的 | |
numbers[last] = numbers[first]; | |
break; | |
} | |
first++; | |
} | |
} | |
numbers[first] = key; | |
qsort(numbers, startIndex, first - 1); | |
qsort(numbers, first + 1, endIndex); //first last 此时first last应该相等 | |
} | |
qsort(rawNumbers, 0, rawNumbers.length); | |
console.log(rawNumbers); |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment