Merge pull request deutranium#185 from RiyaM16/master

Fixed links in Readme.md

Author: codelixir

Readme.md

@@ -30,17 +30,21 @@ Basically these are supposed to be my notes, but feel free to use them as you wi
 - [Searching](#searching-algorithms)
 - [Sorting](#sorting-algorithms)
 - [Primality Test](#primality-test)
-- [Classic algorithms](#classic-algos)
+- [Classic algorithms](#classic-algorithms)
 
 <hr>
 
 ### [Searching Algorithms](searchingAlgo)
 - [Binary Search](searchingAlgo/binarySearch)
+- [Breadth First Search](searchingAlgo/breadthFirstSearch)
+- [Depth First Search](searchingAlgo/DepthFirstSearch)
 - [Exponential Search](searchingAlgo/exponentialSearch)
 - [Fibonacci Search](searchingAlgo/fibonacciSearch)
 - [Interpolation Search](searchingAlgo/interpolationSearch)
 - [Jump Search](searchingAlgo/jumpSearch)
+- [KMP Search](searchingAlgo/kmpSearch)
 - [Linear Search](searchingAlgo/linearSearch)
+- [Rabin-Karp Search](searchingAlgo/rabinKarpSearch)
 - [Sublist Search](searchingAlgo/sublistSearch)
 - [Ternary Search](searchingAlgo/ternarySearch)
 
@@ -59,17 +63,24 @@ Basically these are supposed to be my notes, but feel free to use them as you wi
 - [Radix Sort](sortingAlgo/radixSort)
 - [Selection Sort](sortingAlgo/selectionSort)
 - [Shell Sort](sortingAlgo/ShellSort)
+- [Tim Sort](sortingAlgo/timSort)
 
 ### [Primality Test](primalityTest)
 - [Optimised School Method](primalityTest/optimisedSchoolMethod) (Check factors till √n)
 - [Fermat Method](primalityTest/fermatMethod)
 - [Miller-Rabin Method](primalityTest/millerRabinMethod)
+- [Sieve of Eratosthenes](primalityTest/Sieve%20of%20Eratosthenes)
 - [Solovay-Strassen Method](primalityTest/solovayStrassenMethod)
 
-### [Classic Alogorithms](ClassicalAlgos)
-- [Kosaraju's algorithm](ClassicalAlgos/Kosaraju'sAlgo)
-- [Tries](ClassicalAlgos/tries)
-- [0/1 Knappsack](ClassicalAlgos/0-1KnappSack)
-- [Prim's Algorithm](ClassicalAlgos/primsAlgoMST)
-- [Sieve Of Eratosthenes](ClassicalAlgos/sieveOfEratosthenes)
-- [Lowest Common Ancestor](ClassicalAlgos/lowestCommonAncestor_BinaryTrees)
+### [Classic Algorithms](classicalAlgos)
+- [0/1 Knappsack](classicalAlgos/0-1KnappSack)
+- [Dijkstra's Algorithm](classicalAlgos/dijkstrasAlgorithm)
+- [Kadane's Algorithm](classicalAlgos/kadanesAlgorithm)
+- [Kosaraju's algorithm](classicalAlgos/kosarajusAlgorithm)
+- [Kruskal's Algorithm](classicalAlgos/kruskalsAlgorithm)
+- [Lowest Common Ancestor](classicalAlgos/lowestCommonAncestorBinaryTrees)
+- [Prim's Algorithm](classicalAlgos/primsAlgoMST)
+- [Tarjan's algorithm](classicalAlgos/tarjansAlgo)
+- [Tries](classicalAlgos/tries)
+
+