Merge pull request #1 from cormacpayne/master

Updating the repository

Author: shashishailaj

Notes/Graph-Theory.md

@@ -1,4 +1,4 @@
-# Competitive Programming
+# Data Structures and Algorithms
 
 ## Introduction
 
@@ -28,20 +28,22 @@ Below are books that I recommend reading if you are interested in learning more
 
 ### Getting Started
 
-- [Introduction to Problem Solving](./Notes/Problem-Solving.md)
-- [Basic Data Structures](./Notes/Data-Structures.md)
-- [Bits and Subsets](./Notes/Bits-and-Subsets.md)
-- [Binary Search](./Notes/Binary-Search.md)
+- [Introduction to Problem Solving](./problem-solving)
+- [Basic Data Structures](./data-structures/introduction)
+- [Bits and Subsets](./bits-and-subsets.md)
+- [Binary Search](./binary-search.md)
 
 ### Graph Theory
 
-- [Introduction to Graph Theory](./Notes/Graph-Theory.md)
-- [Dijkstra's Algorithm](./Notes/Dijkstras-Algorithm.md)
+- [Introduction to Graph Theory](./graph-theory/introduction)
+- [Breadth-First Search](./graph-theory/traversal/breadth-first-search)
+- [Depth-First Search](./graph-theory/traversal/depth-first-search)
+- [Dijkstra's Algorithm](./graph-theory/shortest-path/dijkstras-algorithm)
 
 ### Dynamic Programming
 
-- [Introduction to Dynamic Programming](./Notes/Dynamic-Programming.md)
-- [Bitmask Dynamic Programming](./Notes/Bitmask-Dynamic-Programming.md)
+- [Introduction to Dynamic Programming](./dynamic-programming/introduction)
+- [Bitmask Dynamic Programming](./dynamic-programming/bitmask-dynamic-programming)
 
 ## Wish List
 

README.md

@@ -77,24 +77,7 @@ Now that we have the three possible scenarios handled, we just need to define wh
 
 We want to keep searching while we have some range of numbers to check, so if `lo` ever becomes greater than `hi`, then our target value is not in the array due to the fact that we have run out of numbers to check.
 
-```java
-int lo = 0;
-int hi = N-1;
-
-while (lo <= hi)
-{
-  mid = lo + (hi -lo) / 2;
-  
-  if (array[mid] == targetValue)
-      break;
-  
-  if (array[mid] < targetValue)
-      lo = mid + 1;
-  
-  if (array[mid] > targetValue)
-      hi = mid - 1;
-}
-```
+![binary-search](../resources/binary-search.png)
 
 ## Problems