Nodejs Array Swap swap(i,j)

Method Source Code

Array.prototype.swap = function(i,j){
   var a = this;/*from  w  w w  .ja  va 2  s  . c o  m*/
   if(i!=j){
      a[j]^=a[i];
      a[i]^=a[j];
      a[j]^=a[i];
   }
}

Related

1. swap(i, j)

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

2. swap(i, j)

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

3. swap(i, j)

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

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

5. swap(i, j)

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

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

7. swap(index1, index2)

   Array.prototype.swap = function(index1, index2) {
       var temp = this[index1];
       this[index1] = this[index2];
       this[index2] = temp;
   };
   

8. swap(index1, index2)

   Array.prototype.swap = function(index1, index2) { 
     let temp = this[index1]; 
     this[index1] = this[index2]; 
     this[index2] = temp 
   };
   

9. swap(indexA, indexB)

   export default function stringPermutation(string) {
     let permutations = []
     function recursivePermutations(array, index) {
       if(index === array.length) {
         permutations.push(array.join(''))
         return
       for (let i = index; i < array.length; i++) {
         let copy = array.slice(0)
   ...