paragonica challenges

bubblesortone.js

// http://www.paragonica.com/
// ---

// # Bubble Sort One

/*
 Bubble sort algorithms repeatedly step through a list of items to be sorted. Adjacent items are compared and swapped if they are in the wrong order. You repeat going through the list until no swaps are needed, indicating the list is sorted. Bubble sort is named for the way elements 'bubble' to the top of the list.

Challenge - create a function that takes an array as a parameter and performs a bubble sort to sort the following array of fruits in alphabetical order:

[ 'grape', 'banana', 'apple', 'orange', 'apricot', 'kiwi', 'strawberry']

*/

function bubbleSortOne(fruits) {
  var needsNextPass = false;
  fruits.forEach(function(fruit, i, fruits) {
    if (i === fruits.length - 1) {return;}

    if (fruits[i] < fruits[i+1]) {return;}
    
    fruits[i] = fruits[i + 1];
    fruits[i+1] = fruit;
    needsNextPass = true;
  });

  if (needsNextPass) { return bubbleSortOne(fruits); }
  return fruits;

}

bubbleSortOne([ 'grape', 'banana', 'apple', 'orange', 'apricot', 'kiwi', 'strawberry'])