jocelynsaysrawr / bubble-sort

Bubble Sort Algorithm

bubble-sort

Bubble Sort Algorithm

There are many algorithms that deal with sorting collections of data. One of the most basic forms of sorting is known as Bubble Sort and is named by it's nature of the order of data having a "bubbling" effect as a collection of data is sorted. We will start off by implementing a Bubble Sort algorithm on a one-dimensional Array.

Bubble Sort Implementation

The trick to remembering bubble sort is to visualize that your array is vertical rather than horizontal. If smaller values are "deeper" in the array, they will "rise" to the top until they are the smallest value. If larger values are "higher" in the array, they will sink to the bottom until they are the largest value.

Instructions

1. Fork this repository to your own Github account.
2. Clone down the forked repo from your Github account to your local development environment.
3. In the project directory on your local machine, install all the npm modules with npm install.
4. Your answers should go in the bubble-sort.js file.
5. Check if the tests pass by entering npm test in the terminal.