Updated Searching.rst

Author: OmkarPathak

docs/Searching.rst

@@ -78,32 +78,73 @@ Binary Search
 -------------
 
 * Functions and their uses
-    - search(List, key)   : returns the position (index) of the key if key found, else returns -1. Note: `List` parameter **must** be sorted
-    - time_complexities() : returns time complexities (Best, Average, Worst)
-    - get_code()          : returns the code for the ``binary_search.search()`` function
+    - .. function:: binary_search.search(List, key)
+
+    |**List**            : *Sorted* list in which the key is to be searched
+    |**key**             : key to be searched in the list
+    |**Return Value**    : returns the position (index) of the key if key found, else returns -1
+
+    - .. function:: binary_search.time_complexities()
+
+    |**Return Value**    : returns time complexities (Best, Average, Worst)
+
+    - .. function:: binary_search.get_code()
+
+    |**Return Value**    : returns the code for the ``binary_search.search()`` function
 
 Linear Search
 -------------
 
 * Functions and their uses
-    - search(List, key)   : returns the position (index) of the key if key found, else returns -1
-    - time_complexities() : returns time complexities (Best, Average, Worst)
-    - get_code()          : returns the code for the ``linear_search.search()`` function
+
+    - .. function:: linear_search.search(List, key)
+
+    |**List**            : the list in which item is to searched
+    |**key**             : key to be searched in the list
+    |**Return Value**    : returns the position (index) of the key if key found, else returns -1
+
+    - .. function:: linear_search.time_complexities()
+
+    |**Return value**      : returns time complexities (Best, Average, Worst)
+    - .. function:: linear_search.get_code()
+
+    |**Return Value**      : returns the code for the ``linear_search.search()`` function
 
 Breadth First Search
 --------------------
 
 * Functions and their uses
-    - .. function:: search(graph, startVertex)
 
-    **graph**       : takes the graph data structures with edges and vertices
-    **startVertex** : it tells the function the vertex to start with
-    Return Value    : returns the bfs for the ``graph``
+    - .. function:: breadth_first_search.search(graph, startVertex)
+
+    |**graph**           : takes the graph data structures with edges and vertices
+    |**startVertex**     : it tells the function the vertex to start with
+    |**Return Value**    : returns the bfs for the ``graph``
+
+    - .. function:: breadth_first_search.time_complexities()
+
+    **Return Value**    : returns time complexities
+
+    - .. function:: breadth_first_search.get_code()
+
+    **Return Value**    : returns the code for the ``breadth_first_search.search()`` function
+
+Depth First Search
+------------------
+
+* Functions and their uses
+
+    - .. function:: breadth_first_search.search(graph, start, path)
+
+    |**graph**           : takes the graph data structures with edges and vertices
+    |**start**           : it tells the function the vertex to start with
+    |**path**            : returns the list containing the required dfs
+    |**Return Value**    : returns the bfs for the ``graph``
 
-    - .. function:: time_complexities()
+    - .. function:: breadth_first_search.time_complexities()
 
-    Return Value    : returns time complexities
+    **Return Value**    : returns time complexities
 
-    - .. function:: get_code()
+    - .. function:: breadth_first_search.get_code()
 
-    Return Value    : returns the code for the ``breadth_first_search.search()`` function
+    **Return Value**    : returns the code for the ``depth_first_search.search()`` function