Select Sort addition
DFS and BFS for graphs
Add a color key
Space Complexity correction

Space Complexity correction from O(N) to O(1)
Green should be Red..
Binary search

The name of the algorithm is Binary search, and it runs on a sorted array. First line of its page on Wikipedia:
> In computer science, a binary search or half-interval search algorithm finds the position of a specified value (the input "key") within a sorted array.
Remove a vertex in an adjacency list takes O(V+E)
Added shortest path algorithms (Dijkstra + Bellman-Ford)
Add section on Heaps
Add linear time sorts
Add delete operation
Add dictionary-search
Added skiplist
Merge pull request #5 from jay754/master

Select Sort Addition
Merge pull request #7 from agfor/master

Update Sorting table
Merge pull request #9 from qpleple/dfs-bfs

DFS and BFS for graphs
Merge pull request #10 from jdavis/master

Color Key
Merge pull request #11 from qpleple/patch-1

Binary search
Merge pull request #12 from qpleple/patch-2

Remove a vertex in an adjacency list takes O(V+E)
Merge pull request #13 from qpleple/shortest-path

Added shortest path algorithms (Dijkstra + Bellman-Ford)