Here you can find the source of swap(i, j)
Array.prototype.swap = function (i, j) { var tmp = this[i]; this[i] = this[j];// ww w . ja va 2 s . c o m this[j] = tmp; };
function bubbleSort(arr) { if (arr.length === 0 || arr.length === undefined) { return "No array as arg!" if (arr.length === 1) { return arr; var swapped = true; while (swapped) { ...
Array.prototype.swap = function(i, j) { var a = this[i]; this[i] = this[j]; this[j] = a;
Array.prototype.swap = function(i, j){ var temp = this[i] this[i] = this[j] this[j] = temp
Array.prototype.swap = function (i, j) { var k = this[i]; this[i] = this[j]; this[j] = k; function bubbleSort(list) { var items = list.slice(0), swapped = false, p, q; for (p = 1; p < items.length; ++p) { for (q = 0; q < items.length - p; ++q) { if (items[q + 1] < items[q]) { items.swap(q, q + 1); ...
'use strict'; Array.prototype.swap = function (i, j) { const temp = this[i]; this[i] = this[j]; this[j] = temp; function qsort (arr, lo=0, hi=arr.length - 1) { if (lo >= hi) return; arr.swap(lo, Math.floor(Math.random() * (hi - lo)) + lo); ...
Array.prototype.swap = function(i,j){ var a = this; if(i!=j){ a[j]^=a[i]; a[i]^=a[j]; a[j]^=a[i];
function quickSort(arr){ function partition(low, high){ if(high - low < 2){ return var pivot = arr[low] var wall = low for(var i = low; i <= high; i++){ if(arr[i] < pivot){ ...
Array.prototype.swap = function(index1, index2) { var temp = this[index1]; this[index1] = this[index2]; this[index2] = temp; };
Array.prototype.swap = function(index1, index2) {
let temp = this[index1];
this[index1] = this[index2];
this[index2] = temp
};