JS-Algorithms

Classic data structures and algorithms (with tests!) written in JavaScript

• Singly Linked List
• Min/Max Binary Heap
• Trie (With Pre-Order Traversal Sorting)
• Stack (push, pop, peek, and isEmpty)
• Queue (add, remove, peek, isEmpty)
• Binary Search Tree
• Hash Table

As well as the following algorithms:

• Breadth First Search
• Depth First Search
• Binary Search
• Merge Sort
• Quick Sort
• Shuffle (Fisher–Yates)

This project contains a collection of solved problems.

Hopefully these serve as examples of how to use these algorithms and data structures.

I've documented the process of creating this code here.

##Usage

If you want access to these data structures in your project, include this package.

> var algorithms: = require('js-algorithms')
> algorithms
{
  dataStructures: {
    binaryHeap: [Function],
    binarySearchTree: [Function: bst],
    linkedList: [Function],
    maxHeap: [Function],
    minHeap: [Function],
    queue: [Function],
    stack: [Function],
    stackQueue: [Function],
    trie: [Function] },
  algorithms: {
    sorting: {
      quickSort: [Function]
      mergeSort: [Function]
    },
    shuffle: [Function]
  }}