Nodejs Array Swap swap(i, j)

Method Source Code

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);/*from  ww w.j a v a 2 s . c o  m*/
                swapped =true;
            }
        }
        if (!swapped) break;
    }
    return items;
}

var N = 100, data = []; while (N > 0) data.push(N--);
bubbleSort(data);

Related

1. swap(a, b)

   Array.prototype.swap=function(a, b)
     var tmp=this[a];
     this[a]=this[b];
     this[b]=tmp;
   function insert(array, begin, end, v)
     while(begin+1<end && array[begin+1]<v) {
   ...
   

2. swap(a,b)

   Array.prototype.swap = function(a,b){
     var tmp = this[a];
     this[a] = this[b];
     this[b] = tmp;
   

3. swap(firstIndex, secondIndex)

   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) {
   ...
   

4. swap(i, j)

   Array.prototype.swap = function(i, j) {
     var a = this[i];
     this[i] = this[j];
     this[j] = a;
   

5. swap(i, j)

   Array.prototype.swap = function(i, j){
     var temp = this[i]
     this[i] = this[j]
     this[j] = temp
   

6. swap(i, j)

   '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);
   ...
   

7. swap(i, j)

   Array.prototype.swap = function (i, j) {
       var tmp = this[i];
       this[i] = this[j];
       this[j] = tmp;
   };
   

8. swap(i,j)

   Array.prototype.swap = function(i,j){
     var a = this;
     if(i!=j){
       a[j]^=a[i];
       a[i]^=a[j];
       a[j]^=a[i];
   

9. swap(idx1, idx2)

   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){
   ...