task: metadata: install: pip install -e .
patch: diff --git a/dsalgo/sort.py b/dsalgo/sort.py
index 0804112..5d30b2f 100644
--- a/dsalgo/sort.py
+++ b/dsalgo/sort.py
@@ -8,7 +8,12 @@ class Sort:
           :array: (list) : a python list
           :algo: (str): sorting algorithm type
                             values supported are:
-                            1. bubble
+                            1.bubble
+                            2.merge
+                            3.bubble_recursion
+                            4.selection
+                            5.quick
+
           :reverse: (bool) : default = False
                             if True order is reversed.
         return:
@@ -20,9 +25,16 @@ class Sort:
 
         if self.algo == 'bubble':
             return bubble(self.array, self.reverse)
+        if self.algo == 'merge':
+            return merge(self.array, self.reverse)
+        if self.algo =='bubble_recursion':
+            return bubble_recursion(self.array,self.reverse)
+        if self.algo =='selection':
+            return selection(self.array,self.reverse)
+        if self.algo =='quick':
+            return quick(self.array,self.reverse)
         else:
             sys.stderr.write("Error: unsupported sorting algorithm passed!")
-
         
 def bubble(array, reverse=False):
     '''
@@ -50,3 +62,142 @@ def bubble(array, reverse=False):
     if reverse==True:
         return array[::-1]
     return array
+
+def merge(array,reverse=False):
+
+
+    """
+    1.Divide:
+    If q is the half-way point between p and r, then we can split the subarray A[p..r] 
+    into two arrays A[p..q] and A[q+1, r].
+    2.Conquer:
+    In the conquer step, we try to sort both the subarrays A[p..q] and A[q+1, r]. 
+     If we haven't yet reached the base case,
+     we again divide both these subarrays and try to sort them.
+    3.Combine:
+    When the conquer step reaches the base step and we get two sorted subarrays A[p..q] and A[q+1, r] for array A[p..r],
+    we combine the results by creating a sorted array A[p..r] from two sorted subarrays A[p..q] and A[q+1, r].
+    """
+    
+    if len(array) >1: 
+        mid = len(array)//2  # mid
+        left = array[:mid]   # Dividing the array elements  
+        right = array[mid:]  # into 2 halves 
+  
+        merge(left)        # Sorting the first half 
+        merge(right)       # Sorting the second half 
+        i = j = k = 0
+          
+        # Copy data to left[] and right[] 
+        while i < len(left) and j < len(right): 
+            if left[i] < right[j]: 
+                array[k] = left[i] 
+                i+= 1
+            else: 
+                array[k] = right[j] 
+                j+= 1
+            k+= 1
+          
+        # Checking if any element was left 
+        while i < len(left): 
+            array[k] = left[i] 
+            i+= 1
+            k+= 1
+          
+        while j < len(right): 
+            array[k] = right[j] 
+            j+= 1
+            k+= 1
+    if reverse==True :
+     return array[::-1]
+    return array
+
+def bubble_recursion(array,reverse=False): 
+    for i, num in enumerate(array): 
+        try: 
+            if array[i+1] < num: 
+                array[i] = array[i+1] 
+                array[i+1] = num 
+                bubble_recursion(array) 
+        except IndexError: 
+            pass
+    if reverse==True:
+     return array[::-1]
+    return array
+
+def selection(array,reverse=False):
+    """The selection sort algorithm sorts an array by repeatedly finding the minimum element (considering ascending order)
+       from unsorted part and putting it at the beginning. The algorithm maintains two subarrays in a given array.
+
+        1) The subarray which is already sorted.
+        2) Remaining subarray which is unsorted.
+        In every iteration of selection sort, the minimum element (considering ascending order)
+        from the unsorted subarray is picked and moved to the sorted subarray."""
+
+    for i in range(len(array)): 
+         min_idx = i 
+         for j in range(i+1, len(array)): 
+             if array[min_idx] > array[j]: 
+                 min_idx = j
+         array[i], array[min_idx] = array[min_idx], array[i] #Swapping values
+
+    if reverse==True:
+     return array[::-1]
+
+    return array  
+
+def quick(array,reverse=False):
+    """The algorithm can be broken down into three parts​​:
+       1.Partitioning the array about the pivot.
+       2.Passing the smaller arrays to the recursive calls.
+       3.Joining the sorted arrays that are returned from the recursive call and the pivot.
+       
+    """
+    start=0
+    end=len(array)-1
+    quick_sort(array,start,end)
+
+    if reverse==True:
+      return array[::-1]
+
+    return array
+
+def quick_sort(array, start, end):
+      if start >= end:
+         return
+
+      p = partition(array, start, end)
+      quick_sort(array, start, p-1)
+      quick_sort(array, p+1, end)
+
+def partition(array, start, end):
+    pivot = array[start]
+    low = start + 1
+    high = end
+
+    while True:
+        #If the current value we're looking at is larger than the pivot
+        # it's in the right place (right side of pivot) and we can move left,
+        # to the next element.
+        # We also need to make sure we haven't surpassed the low pointer, since that
+        # indicates we have already moved all the elements to their correct side of the pivot
+        while low <= high and array[high] >= pivot:
+            high = high - 1
+
+        # Opposite process of the one above
+        while low <= high and array[low] <= pivot:
+            low = low + 1
+
+        # We either found a value for both high and low that is out of order
+        # or low is higher than high, in which case we exit the loop
+        if low <= high:
+            array[low], array[high] = array[high], array[low]
+            # The loop continues
+        else:
+            # We exit out of the loop
+            break
+
+    array[start], array[high] = array[high], array[start]
+
+    return high
+

problem_statement: Basic sorting algorithms
Implement all the sorting algorithms using class in one python file. For more details about implementation contact @KapilBansal320  
repo: codesankalp/dsalgo
test_cmd: pytest --no-header -rA --tb=line --color=no -p no:cacheprovider -W ignore::DeprecationWarning
test_patch: diff --git a/tests/sort_tests.py b/tests/sort_tests.py
new file mode 100644
index 0000000..690f6d2
--- /dev/null
+++ b/tests/sort_tests.py
@@ -0,0 +1,51 @@
+import unittest
+from dsalgo.sort import Sort
+import random 
+class TestSort(unittest.TestCase):
+    def setUp(self):
+         self.testArray=[]
+         self.bySort=[]
+         self.revBySort=[]
+         for item in range(0,5):
+             self.testArray.append(round(((item*random.random())*20),2))
+         self.bySort=self.testArray.copy()
+         self.revBySort=self.testArray.copy()
+         self.bySort.sort()
+         self.revBySort.sort(reverse=True)
+            
+    def test_bubble(self):
+         sortedArray=Sort(self.testArray,"bubble")
+         self.assertEqual(self.bySort,sortedArray)
+         revsortedArray=Sort(self.testArray,"bubble",True)
+         self.assertEqual(self.revBySort,revsortedArray)
+    
+    def test_merge(self):
+         sortedArray=Sort(self.testArray,"merge")
+         self.assertEqual(self.bySort,sortedArray)
+         revsortedArray=Sort(self.testArray,"merge",True)
+         self.assertEqual(self.revBySort,revsortedArray)
+
+    def test_bubble_recursion(self):
+         sortedArray=Sort(self.testArray,"merge")
+         self.assertEqual(self.bySort,sortedArray)
+         revsortedArray=Sort(self.testArray,"merge",True)
+         self.assertEqual(self.revBySort,revsortedArray)
+
+    def test_selection(self):
+         sortedArray=Sort(self.testArray,"merge")
+         self.assertEqual(self.bySort,sortedArray)
+         revsortedArray=Sort(self.testArray,"merge",True)
+         self.assertEqual(self.revBySort,revsortedArray)
+         
+    def test_quick(self):
+         sortedArray=Sort(self.testArray,"merge")
+         self.assertEqual(self.bySort,sortedArray)
+         revsortedArray=Sort(self.testArray,"merge",True)
+         self.assertEqual(self.revBySort,revsortedArray)
+
+if __name__=='__main__':
+    unittest.main()
+
+
+
+