Merge branch 'main' of https://github.com/siddharth25pandey/visualAlgo into main

Author: siddharth25pandey

README.md

@@ -1,14 +1,14 @@
 # visualAlgo
-lgorithms visualised:
+## Algorithms visualised:
 # 1) Sorting Algorithms 
     a) Bubble Sort
     b) Selection Sort 
     c) Merge Sort
     d) Quick Sort
     e) Insertion Sort
 # 2) Graph Traversal (Path finding Algos) 
- #   Blind search algorithms such as breadth-first and depth-first exhaust all possibilities; starting from the given node, they iterate over all possible paths until they reach        the goal node. 
- #   Dijkstra follows a greedy approach and is smart path finding algorithm
+ ####   Blind search algorithms such as breadth-first and depth-first exhaust all possibilities; starting from the given node, they iterate over all possible paths until they reach        the goal node. 
+ ####   Dijkstra follows a greedy approach and is smart path finding algorithm
 
     a) Breadth First Search (BFS) 
     b) Depth First Search (DFS)