v0.4.0 Selection Sort, Radix Sort, DFS, Euler path, Knuth-Morris-Pratt

Author: felipernb

CHANGELOG

@@ -1,58 +1,69 @@
 CHANGELOG
 =========
+0.4.0 (2014-06-06)
+* Sorting
+ * Selection Sort
+ * Radix Sort
+
+* Graphs
+ * DFS
+ * Euler path
+
+* String
+ * Knuth-Morris-Pratt
 
 0.3.0 (2014-06-03)
 * Math
-** Square root by Newton's method
+ * Square root by Newton's method
 
 * Data Structures
-** Hash table
+ * Hash table
 
 * Sorting
-** Insertion sort
-** Heap sort
-** Counting sort
+ * Insertion sort
+ * Heap sort
+ * Counting sort
 
 0.2.0 (2014-06-01)
 * Graphs
-** Shortest Path Faster Algorithm (#34)
-** Bellman-Ford Shortest Path (#36)
+ * Shortest Path Faster Algorithm (#34)
+ * Bellman-Ford Shortest Path (#36)
 
 * Math
-** Extended Euclidean Algorithm (#37)
+ * Extended Euclidean Algorithm (#37)
 
 * Strings
-** Karp-Rabin String Matching (#35)
+ * Karp-Rabin String Matching (#35)
 
 
 0.1.0 (2014-05-30)
 * Sorting
-** Bubble Sort
-** Quicksort
-** Merge sort
+ * Bubble Sort
+ * Quicksort
+ * Merge sort
 
 * Graphs
-** Dijkstra
-** Topological Sort
+ * Dijkstra
+ * Topological Sort
 
 * Math
-** Fibonacci
-** Fisher-Yates
-** Euclidean GCD
+ * Fibonacci
+ * Fisher-Yates
+ * Euclidean GCD
 
 * Search
-** Binary Search
-** Breadth first search (for BSTs)
-** Depth first search (for BSTs)
+ * Binary Search
+ * Breadth first search (for BSTs)
+ * Depth first search (for BSTs)
 
 * String
-** Levenshtein edit distance
+ * Levenshtein edit distance
 
 * Data Structures
-** Binary Search Tree
-** Graph
-** Heap
-** Linked list
-** Priority Queue
-** Queue
-** Stack
+ * Binary Search Tree
+ * Graph
+ * Heap
+ * Linked list
+ * Priority Queue
+ * Queue
+ * Stack

package.json

@@ -1,6 +1,6 @@
 {
   "name": "algorithms",
-  "version": "0.3.0",
+  "version": "0.4.0",
   "description": "Traditional computer science algorithms and data structures implemented in JavaScript",
   "directories": {
     "test": "test"