Pinned

1. Merge Sort Algorithm

   1

   /*

   2

     Merge Sort

   3

   */

   4

   5

   const mergeSort = (nums) => {

2. Bubble Sort Algorithm

   1

   /*

   2

     Bubble sort works by comparing two adjacent numbers next to each other and then

   3

     swapping their places if the smaller index's value is larger than the larger

   4

     index's. Continue looping through until all values are in ascending order

   5

   */

3. Insertion Sort Algorithm

   1

   /*

   2

     Insertion sort

   3

     The idea here is that the beginning of your list is sorted and the everything else is assumed to be an unsorted mess.

   4

     The outer loop goes over the whole list, the index of which signifies where the "sorted" part of the list is. The inner

   5

     loop goes over the sorted part of the list and inserts it into the correct position in the array.

4. Simple recursion example

   1

   /*

   2

     Make a function that computes a factorial recursively.

   3

     A factorial is when you take a number n and multiply by each preceding integer until you hit one.

   4

     n * (n-1) * (n-2) ... * 3 * 2 * 1

   5

5. ES6Migrate Public archive

   CLI tool for auto migrating ES5 codebases to ES6

   JavaScript 1

6. PURE_ES6_APP Public archive

   JavaScript