forked from rtvt123/Algorithm-Implementations
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathquick_sort.js
More file actions
64 lines (52 loc) · 2.35 KB
/
quick_sort.js
File metadata and controls
64 lines (52 loc) · 2.35 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
/*
Copyright (c) 2013 Douglas Mak
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
*/
function getRandomInt(numberOfNumbers, type) {
return Math.floor(Math.random() * (max - min + 1)) + min;
}
function swapElements(array, indexI, indexJ) {
var temp = array[indexI];
array[indexI] = array[indexJ];
array[indexJ] = temp;
}
function partition(arrayOfNumbers, first, last, pivotIndex) {
var pivotValue = arrayOfNumbers[pivotIndex];
// Move pivot element to the last spot
swapElements(arrayOfNumbers, pivotIndex, last);
var i = first;
// One over from the right to exclude the pivot element
for(var j = first; j < last; j++ ) {
if(arrayOfNumbers[j] < pivotValue) {
swapElements(arrayOfNumbers, i, j);
i++;
}
}
// Move element to where it belongs
swapElements(arrayOfNumbers, i, last);
return i;
}
function QuickSortRandomPivot(arrayOfNumbers, first, last) {
if( first < last ) {
var pivotIndex = getRandomInt(first, last);
var newPivotIndex = partition(arrayOfNumbers, first, last, pivotIndex);
QuickSortRandomPivot(arrayOfNumbers, first, newPivotIndex-1);
QuickSortRandomPivot(arrayOfNumbers, newPivotIndex+1, last);
}
return arrayOfNumbers;
}
var sortedNumbers = QuickSortRandomPivot([10, 1, 9, 2, 8, 3, 7, 4, 6, 5], 0, numbersArray.length-1);