Update Exercise_2.py

Author: super30admin

Exercise_2.py

@@ -1 +1,23 @@
+# Python program for implementation of Quicksort Sort 
+  
+# give you explanation for the approach
+def partition(arr,low,high):
+  
+  
+    #write your code here
+  
 
+# Function to do Quick sort 
+def quickSort(arr,low,high): 
+    
+    #write your code here
+  
+# Driver code to test above 
+arr = [10, 7, 8, 9, 1, 5] 
+n = len(arr) 
+quickSort(arr,0,n-1) 
+print ("Sorted array is:") 
+for i in range(n): 
+    print ("%d" %arr[i]), 
+  
+