Updated README

README.md

@@ -11,6 +11,8 @@ Clean example implementations of data structures and algorithms written in diffe
   * [binary search](search/binary_search)
   * [linear search](search/linear_search)
   * [jump search](search/jump_search)
+  * [ternary search](search/ternary_search)
+  * [interpolation search](search/interpolation_search)
 * [Sort](sort)
   * [bubble sort](sort/bubble_sort)
   * [insertion sort](sort/insertion_sort)
@@ -21,6 +23,9 @@ Clean example implementations of data structures and algorithms written in diffe
   * [counting sort](sort/counting_sort)
   * [radix sort](sort/radix_sort)
   * [shell sort](sort/shell_sort)
+  * [comb sort](sort/Comb_sort)
+  * [bucket sort](sort/bucket_sort)
+  * [cycle sort](sort/cycle_sort)
 * [Math](math)
   * [russian peasant](math/russian_peasant)
   * [towers of hanoi](math/towers_of_hanoi)
@@ -40,6 +45,7 @@ Clean example implementations of data structures and algorithms written in diffe
   * [catalan number](math/catalan)
   * [moments](math/moments)
   * [primality check](math/is_prime)
+  * [euler's totient](math/eulers_totient_function)
 * [Cryptography](cryptography)
   * [caesar cipher](cryptography/caesar_cipher)
   * [substitution cipher](cryptography/substitution_cipher)
@@ -50,18 +56,24 @@ Clean example implementations of data structures and algorithms written in diffe
   * [codewheel](cryptography/codewheel)
   * [end to end](cryptography/end_to_end)
   * [polybius cipher](cryptography/polybius_cipher)
+  * [atbash cipher](cryptography/atbash_cipher)
+  * [hill cipher](cryptography/hillcipher)
+  * [rail fence cipher](cryptography/rail_fence_cipher)
 * [Greedy](greedy)
   * [dijkstra’s algorithm](greedy/dijkstra’s_algorithm)
   * [kruskal's algorithm](greedy/kruskal's_algorithm)
   * [prim's algorithm](greedy/prim's_algorithm)
   * [job sequencing problem](greedy/Job_sequencing_problem)
   * [egyptian fraction](greedy/egyptian_fraction)
+  * [activity selection](greedy/activity_selection)
+  * [knapsack problem](greedy/knapsack_problem)
 * [Graphs](graphsearch)
   * [breadth-first-search](graphsearch/breadth-first-search)
   * [depth-first-search](graphsearch/depth-first-search)
   * [topological sorting](graphsearch/topological_sorting)
   * [a-star search](graphsearch/a-star-search)
   * [dijkstra](graphsearch/dijkstra)
+  * [dinics algorithm](graphsearch/dinics_algorithm)
 * [String search](string_search)
   * [knuth morris pratt](string_search/knuth_morris_pratt)
   * [rabin karp](string_search/rabin_karp)
@@ -78,6 +90,10 @@ Clean example implementations of data structures and algorithms written in diffe
   * [coin change](dp/coin_change)
   * [longest common subsequence](dp/longest_common_subsequence)
   * [longest increasing subsequence](dp/longest_increasing_subsequence)
+  * [longest palindromic subsequence](dp/longest_palindromic_subsequence)
+  * [maximum subarray problem](dp/maximum_subarray_problem)
+  * [rod cutting](dp/rod_cutting)
+  * [subset sum](dp/subset_sum)
 * [Data structures](data_structures)
   * [linked list](data_structures/linked_list)
   * [avl tree](data_structures/avl_tree)
@@ -86,10 +102,20 @@ Clean example implementations of data structures and algorithms written in diffe
   * [dictionary](data_structures/dictionary)
   * [queue](data_structures/Queue)
   * [stack](data_structures/Stack)
+  * [hash table](data_structures/hash_table)
+  * [binary search tree](data_structures/binarySearch_tree)
+  * [binary indexed tree](data_structures/binary_indexed_tree)
+  * [red and black tree](data_structures/red_and_black_tree)
+  * [segment tree](data_structures/segment_tree)
+  * [splay tree](data_structures/Splay_trees)
 * [Backtracking](backtracking)
   * [sudoku](backtracking/sudoku)
   * [knights tour](backtracking/knightsTour)
   * [n queens](backtracking/n-queens)
+  * [rat in a maze](backtracking/rat_in_a_maze)
+  * [wordsearch](backtracking/wordsearch)
+* [Synchronization](synchronization)
+  * [Producer consumer problem](synchronization/ProducerConsumer)
 
 ## Contribution
  * Contributions are always welcome. Language doesn't matter. Just make sure you're implementing an algorithm.