Updated README

Author: shreyasvedpathak

README.md

@@ -1,4 +1,14 @@
-# Algorithms and Data Structures from Scratch In Python.
+# Algorithms and Data Structures from Scratch In Python
 
-## Algorithms:
-1. [Searching Algorithms](/Searching%20Algorithm/)
+## Algorithms
+
+1. Searching Algorithms.
+   1. [Binary Search - both Recursive and Iterative Approach.](Searching%20Algorithm/binarysearch.py)
+2. Sorting Algorithms.
+   1. [Sorting Algorithms Code.](Sorting%20Algorithms/sortingAlgo.py)
+   2. [Random Numbers for Input.](Sorting%20Algorithms/num.txt)
+
+## Data Structures
+
+1. [Linked List.](/Linked%20List/linkedlist.py)
+2. [Circular Linked List.](Linked%20List/circularLL.py)

Sorting Algorithms/README.md

@@ -0,0 +1,16 @@
+# Sorting Algorithms
+
+The code contains 8 different sorting algorithms. The Names and the line number at which you can find the function is listed below.
+
+The code also contains a utility function for finding time required to sort the array by each algorithm.
+
+| Algorithm Name | Line Number |
+|----------------|:-------------:|
+| Selection Sort   | [Line 4](https://github.com/shreyasvedpathak/Data-Structure-Python/blob/af0479bce737f33c715495bb8a3acb371f7b2ffc/Sorting%20Algorithms/sortingAlgo.py#L4)  |
+| Insertion Sort   | [Line 23](https://github.com/shreyasvedpathak/Data-Structure-Python/blob/af0479bce737f33c715495bb8a3acb371f7b2ffc/Sorting%20Algorithms/sortingAlgo.py#L23) |
+| Bubble Sort   | [Line 44](https://github.com/shreyasvedpathak/Data-Structure-Python/blob/af0479bce737f33c715495bb8a3acb371f7b2ffc/Sorting%20Algorithms/sortingAlgo.py#L44)  |
+| Shell Sort   | [Line 61](https://github.com/shreyasvedpathak/Data-Structure-Python/blob/af0479bce737f33c715495bb8a3acb371f7b2ffc/Sorting%20Algorithms/sortingAlgo.py#L61) |
+| Merge Sort | [Line 86](https://github.com/shreyasvedpathak/Data-Structure-Python/blob/af0479bce737f33c715495bb8a3acb371f7b2ffc/Sorting%20Algorithms/sortingAlgo.py#L86)  |
+| Quick Sort  | [Line 141](https://github.com/shreyasvedpathak/Data-Structure-Python/blob/af0479bce737f33c715495bb8a3acb371f7b2ffc/Sorting%20Algorithms/sortingAlgo.py#L141) |
+| Count Sort  | [Line 177](https://github.com/shreyasvedpathak/Data-Structure-Python/blob/af0479bce737f33c715495bb8a3acb371f7b2ffc/Sorting%20Algorithms/sortingAlgo.py#L177) |
+| Radix Sort  | [Line 195](https://github.com/shreyasvedpathak/Data-Structure-Python/blob/af0479bce737f33c715495bb8a3acb371f7b2ffc/Sorting%20Algorithms/sortingAlgo.py#L195) |

Sorting Algorithms/sortingAlgo.py

@@ -255,7 +255,7 @@ def options():
     '''
     options_list = ['Selection Sort', 'Insertion Sort', 'Bubble Sort',
                  'Shell Sort', 'Merge Sort', 'Quick Sort', 'Count Sort', 'Radix Sort',
-                 'Exit']
+                 'Time Required', 'Exit']
     print("MENU")
     for i, option in enumerate(options_list):
         print(f'{i + 1}. {option}')
@@ -282,7 +282,7 @@ def switch_case(choice):
         options()
 
     choice = int(input("Enter your choice: "))
-    if choice != 0: 
+    if choice != 10: 
         switch_case(choice)
     else:
         break