Several algorithms written in several different languages, graphified and descriptified using unix time() and D3 JS poop

###Inspiration

Taken from http://bigocheatsheet.com/ and a failed interview dealing with algorithms and BigO notation

###Algorithms examined

####Searching

• Depth First Search (DFS)
• Breadth First Search (BFS)
• Binary Search
• Brute Force (Linear)

####Sorting

• Quicksort
• Mergesort
• Heapsort
• Bubble Sort
• Insertion Sort
• Select Sort
• Bucket Sort
• Radix Sort

####Data Structures

• Basic Array
• Dynamic Array
• Singly-Linked List
• Doubly-Linked List
• Skip List
• Hash Table
• Binary Search Tree
• Cartresian Tree
• B-Tree
• Red-Black Tree
• Splay Tree
• AVL Tree

####Heaps

• Linked List (sorted)
• Linked List (unsorted)
• Binary Heap
• Binomial Heap
• Fibonacci Heap

####Graphs

• Adjacency list
• Incidence list
• Adjacency matrix
• Incidence matrix

###Languages

• Julia
• Go
• Python
• Haskell
• C
• Rust
• Javascript
• Java7

##Disclaimer This list is almost verbatim from http://bigocheatsheet.com/