-
Notifications
You must be signed in to change notification settings - Fork 1.3k
Expand file tree
/
Copy pathshakersort.js
More file actions
60 lines (56 loc) · 1.48 KB
/
shakersort.js
File metadata and controls
60 lines (56 loc) · 1.48 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
(function (exports) {
'use strict';
function comparator(a, b) {
return a - b;
}
/**
* Shaker sort algorithm.<br><br>
* Complexity: O(N^2).
*
* @example
* var sort = require('path-to-algorithms/src/' +
* 'sorting/shakersort').shakerSort;
* console.log(sort([2, 5, 1, 0, 4])); // [ 0, 1, 2, 4, 5 ]
*
* @public
* @module sorting/shakersort
* @param {Array} array Input array.
* @param {Function} cmp Optional. A function that defines an
* alternative sort order. The function should return a negative,
* zero, or positive value, depending on the arguments.
* @return {Array} Sorted array.
*/
function shakerSort(array, cmp) {
cmp = cmp || comparator;
var temp;
var swapped = true;
while (swapped){
swapped = false;
for (var i = 0; i < array.length - 1 ; i += 1) {
if (cmp(array[i], array[i + 1]) > 0){
temp = array[i];
array[i] = array[i + 1];
array[i + 1] = temp;
swapped = true;
}
}
if (!swapped){
break;
}
swapped = false;
for (var i = array.length - 1; i > 0 ; i -= 1) {
if (cmp(array[i], array[i - 1]) < 0){
temp = array[i];
array[i] = array[i - 1];
array[i - 1] = temp;
swapped = true;
}
}
if (!swapped){
break;
}
}
return array;
}
exports.shakerSort = shakerSort;
})(typeof window === 'undefined' ? module.exports : window);