From 0c49f23eaf04aafc912f52c9e4239f44a78a3ecf Mon Sep 17 00:00:00 2001 From: Anirudh Thatipelli Date: Wed, 2 May 2018 16:19:48 +0530 Subject: [PATCH] Update README.md Added some information regarding breadth-first search algorithm. --- README.md | 5 ++++- 1 file changed, 4 insertions(+), 1 deletion(-) diff --git a/README.md b/README.md index e89f793..18bb1c0 100644 --- a/README.md +++ b/README.md @@ -406,7 +406,10 @@ Its properties: ## Naïve Divide and Conquer TODO ## Breadth first search -TODO +It is a search algorithm which checks for all nodes on a current level before moving on the next level. It is exhausting the **"breadth"** of possibilities at a level before moving on to another level. + +**Read more here** +https://www.commonlounge.com/discussion/88d13209e68d4e4c94bbe9c44b2fc5bc # Sorting ## Bubble sort