Update IMPLEMENTATIONS.md

Wrong links were modified/deleted

IMPLEMENTATIONS.md

@@ -8,8 +8,9 @@
   * [interpolation search](search/interpolation_search)
   * [best first search](search/best_first_search)
   * [exponential search](search/exponential_search)
-  * [sublist search](search/sublist_search)
+  * [sublist search](Sublist%20Search)
   * [fibonacci search](search/fibonacci_search)
+
 * [Sort](sort)
   * [bubble sort](sort/bubble_sort)
   * [bogo sort](sort/bogo_sort)
@@ -27,7 +28,7 @@
   * [bucket sort](sort/bucket_sort)
   * [cycle sort](sort/cycle_sort)
   * [python bucket sort](sort/python_bucket_sort)
-  * [binary insertion sort](sort/binary%20insertion%20sort.cpp)
+  * [binary insertion sort](sort/Binary_Insertion_Sort)
   * [slow sort](sort/Slow_Sort)
   * [Cocktail Selection Sort](sort/Cocktail%20Selection%20Sort)
   * [Circle sort](sort/circle_sort)
@@ -36,16 +37,13 @@
   * [Pigeon Hole sort](sort/pigeonhole_sort)
   * [Sleep sort](sort/sleep_sort)
   * [Stooge sort](sort/stooge_sort)
-  * [Tim sort](sort/tim_sort)
-  * [Pancake sorting](sort/pancake_sort)
-  * [Tree sort](sort/tree_sort)
-  * [strand sort](sort/strand_sort)
-  * [cartesian sort](sort/cartesian_sort)
-  * [Tag sort](sort/tag_sort)
-
+  * [Tim sort](sort/timsort)
+  * [Pancake sorting](sort/pancake%20Sorting)
+  * [Tree sort](sort/0-1TreeSort)
+
 * [Math](math)
   * [russian peasant](math/russian_peasant)
-  * [towers of hanoi](math/towers_of_hanoi)
+  * [towers of hanoi](math/towers_of_Hanoi)
   * [Sieve of Eratosthenes](math/sieve%20of%20eratosthenes)
   * [armstrong number](math/armstrong_number)
   * [euclid's gcd](math/euclids_gcd)
@@ -72,12 +70,11 @@
   * [basic](math/basic)
   * [average stream numbers](math/average_stream_numbers)
   * [babylonian method](math/babylonian_method)
-  * [arithmetic on very large numbers](math/arithmetic%20on%20very%20large%20numbers)
+  * [arithmetic on very large numbers](math/Arithmetic%20on%20Very%20Large%20Numbers)
   * [automorphic numbers](math/automorphic_numbers)
   * [josepheus_problem](math/josepheus_problem)
   * [fast pow](math/fast_pow)
   * [nCr Computations](math/nCr_computations)
-  * [Chinese remainder theorem](math/chinese_remainder_theorem)
 
 * [Cryptography](cryptography)
   * [affine cipher](cryptography/affine_cipher)
@@ -101,8 +98,10 @@
   * [hill cipher](cryptography/hillcipher)
   * [rail fence cipher](cryptography/rail_fence_cipher)
   * [ElGamal](cryptography/ElGamal)
-* [Geometry](geometry)
-  * [graham scan](geometry/graham_scan)
+
+* [Geometry](math/geometry)
+  * [graham scan](math/geometry/graham_scan)
+
 * [Greedy](greedy)
   * [dijkstra’s algorithm](greedy/dijkstra_shortest_path)
   * [huffman coding](greedy/huffman_coding)
@@ -112,10 +111,10 @@
   * [job sequencing problem](greedy/Job_sequencing_problem)
   * [egyptian fraction](greedy/egyptian_fraction)
   * [activity selection](greedy/activity_selection)
-  * [activity selection problem](greedy/activity_selection_problem)
   * [knapsack problem](greedy/knapsack_problem)
+
 * [Graphs](data_structures/Graphs/graphsearch)
-  * [bellman ford algorithm](data_structures/Graphs/graphsearch/bellman_ford_algorithm)
+  * [bellman ford algorithm](data_structures/Graphs/graphsearch/Bellman_Ford_algorithm)
   * [cycle directed graph](data_structures/Graphs/graphsearch/cycle_directed_graph)
   * [cycle undirected graph](data_structures/Graphs/graphsearch/cycle_undirected_graph)
   * [graph coloring](data_structures/Graphs/graphsearch/graph_coloring)
@@ -128,14 +127,17 @@
   * [a-star search](data_structures/Graphs/graphsearch/a-star-search)
   * [dijkstra](data_structures/Graphs/graphsearch/dijkstra)
   * [dinics algorithm](data_structures/Graphs/graphsearch/dinics_algorithm)
-* [String search](string_search)
-  * [knuth morris pratt](string_search/knuth_morris_pratt)
-  * [rabin karp](string_search/rabin_karp)
-  * [quick search](string_search/quick_search)
-  * [tries](string_search/Tries)
-* [Cluster analysis](cluster_analysis)
-  * [k-means](cluster_analysis/k-means)
-  * [DBSCAN](cluster_analysis/dbscan)
+
+* [String search](strings/string_search)
+  * [knuth morris pratt](strings/string_search/knuth_morris_pratt)
+  * [rabin karp](strings/string_search/rabin_karp)
+  * [quick search](strings/string_search/quick_search)
+  * [tries](strings/string_search/Tries)
+
+* [Cluster analysis](machine_learning/cluster_analysis)
+  * [k-means](machine_learning/cluster_analysis/k-means)
+  * [DBSCAN](machine_learning/cluster_analysis/dbscan)
+
 * [Dynamic Programming](dp)
   * [kadane algorithm](dp/kadane-_algorithm)
   * [knapsack algorithm](dp/knapsack_problem)
@@ -146,20 +148,21 @@
   * [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)
+  * [longest palindromic subsequence](dp/longest_palidromic_subsequence)
   * [maximum subarray problem](dp/maximum_subarray_problem)
   * [rod cutting](dp/rod_cutting)
   * [subset sum](dp/subset_sum)
-* [Branch And Bound](Branch%20And%20Bound)
-  * [0/1 Knapsack](Branch%20And%20Bound/0_1%20Knapsack)
+
+* [Branch And Bound](dp/Branch%20And%20Bound)
+  * [0/1 Knapsack](dp/Branch%20And%20Bound/0_1%20Knapsack)
+
 * [Data structures](data_structures)
-  * [disjoint set union](data_structures/disjoint_set_union)
-  * [graphs](data_structures/graphs)
+  * [disjoint set union](data_structures/Disjoint_Set_Union)
+  * [graphs](data_structures/Graphs)
   * [heap](data_structures/heap)
   * [kd tree](data_structures/kd_tree)
   * [linked list](data_structures/linked_list)
   * [avl tree](data_structures/avl_tree)
-  * [heap](data_structures/heap)
   * [b tree](data_structures/b_tree)
   * [dictionary](data_structures/dictionary)
   * [queue](data_structures/Queue)
@@ -171,13 +174,15 @@
   * [segment tree](data_structures/segment_tree)
   * [splay tree](data_structures/Splay_trees)
   * [sqrt decomposition](data_structures/sqrt_root_decomposition)
+
 * [Backtracking](backtracking)
   * [sudoku](backtracking/sudoku)
   * [permutations](backtracking/permutations)
   * [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)
   * [Row and column summations using mutex ](synchronization/ArraysOperationsWithMutex)