Nodejs Array Bubble Sort bubbleSort()

Method Source Code

Array.prototype.bubbleSort = function(){
   var len = this.length;
   var exchange = false;
   var temp;/*from   w ww.  ja  v  a  2s.c  o m*/
   for(var i = 1;i < len;i++){
      for(var j = 0;j < len - i;j++){
         if(this[j] > this[j+1]){
            temp = this[j];
            this[j] = this[j+1];
            this[j+1] = temp;
            exchange = true;
         }
      }
      if(!exchange)
      return this;
   }
   return this;
}

Related

1. bubbleSort()

   var fibonacci = function(num) {
     var fibs = [0, 1];
     if (num < 3) {
       return fibs.slice(0, num);
     while (fibs.length < num) {
       fibs.push(fibs[fibs.length - 1] + fibs[fibs.length - 2]);
     return fibs;
   ...
   

2. bubbleSort()

   Array.prototype.bubbleSort = function() {
     var temp;
     for(var i = 0; i < this.length - 1; i++) {
       for(var z = 0; z <= this.length - i - 1; z++) {
         if(this[z] > this[z + 1]) {
           temp = this[z + 1];
           this[z + 1] = this[z];
           this[z] = temp;
     return this;
   var a = [23,34,55,24,51,56,27,29];
   a.bubbleSort();
   console.log(a);
   

3. bubbleSort()

   function bubbleSort (arr) {
     var swapped = true;
     var swapCount = 0;
     while (swapped === true) {
       swapped = false;
       for (var i = 0; i < arr.length-1; i++) {
         var curr = arr[i];
         var next = arr[i+1];
         if (curr > next) {
   ...
   

4. bubbleSort()

   function bubbleSort(arr){
     var bubbledArr = arr;
     var isSwapped = false;
     var count = 0;
     while(!isSwapped) {
       isSwapped = false;
       var moves = 0;
       for(var i = 0; i < bubbledArr.length -1; i++){
         var curr = bubbledArr[i];
   ...
   

5. bubbleSort()

   Array.prototype.bubbleSort = function (){
     let isSorted = false; 
     while(!isSorted){ 
       isSorted = true;
       for (var i = 0; i < this.length; i++){
         if (this[i] > this[i+1]){ 
           let earlierNum = this[i];
           this[i] = this[i + 1];
           this[i + 1] = earlierNum;
   ...
   

6. bubbleSort()

   Array.prototype.bubbleSort = function () {
       for (var i = this.length-1; i > 0; i--) {
           for (var j = 0; j < i; j++) {
               if(this[j] > this[j+1]) {
                   this.swap(j, j+1);
   };
   ...
   

7. bubbleSort(arr)

   Array.prototype.bubbleSort = function(arr) {
     if(arr !== undefined) {
       this.array = arr.map(function(element){
         return element;
       });
     } else {
       this.array = this.map(function(element){
         return element;
       });
   ...
   

8. bubbleSort_bubbleSorter;

   function _bubbleSorter(sortMe){
     if(!Array.isArray(sortMe)){
       throw new TypeError('Your sortMe needs to be an array');
     for(var j = 0; j < sortMe.length; j++){
       for(var i = 0; i < sortMe.length; i++){
         if(sortMe[i] > sortMe[i+1]){
           var tempNum = sortMe[i];
           sortMe[i] = sortMe[i+1];
   ...
   

9. bubbleSort()

   'use strict';
   Array.prototype.bubbleSort = function bubbleSort() {
     let sorted = false;
     while(!sorted) {
       sorted = true;
       for (let i = 0; i < this.length - 1; i++) {
         if (this[i] > this[i+1]) {
           sorted = false;
           let temp = this[i+1];
   ...