Anonymous user
Sorting algorithms/Comb sort: Difference between revisions
I added Javascript implementation of Comb Sort. Tested with many test cases
m (→{{header|Sidef}}: minor code fix) |
(I added Javascript implementation of Comb Sort. Tested with many test cases) |
||
Line 898:
}
}</lang>
=={{header|JavaScript}}==
<lang javascript>
// Node 5.4.1 tested implementation (ES6)
function is_array_sorted(arr) {
var sorted = true;
for (var i = 0; i < arr.length - 1; i++) {
if (arr[i] > arr[i + 1]) {
sorted = false;
break;
}
}
return sorted;
}
// Array to sort
var arr = [4, 9, 0, 3, 1, 5];
var iteration_count = 0;
var gap = arr.length - 2;
var decrease_factor = 1.25;
// Until array is not sorted, repeat iterations
while (!is_array_sorted(arr)) {
// If not first gap
if (iteration_count > 0)
// Calculate gap
gap = (gap == 1) ? gap : Math.floor(gap / decrease_factor);
// Set front and back elements and increment to a gap
var front = 0;
var back = gap;
while (back <= arr.length - 1) {
// If elements are not ordered swap them
if (arr[front] > arr[back]) {
var temp = arr[front];
arr[front] = arr[back];
arr[back] = temp;
}
// Increment and re-run swapping
front += 1;
back += 1;
}
iteration_count += 1;
}
// Print the sorted array
console.log(arr);
}</lang>
{{out}}
<pre>
[0, 1, 3, 4, 5, 9]
</pre>
=={{header|jq}}==
{{works with|jq|1.4}}
| |||