iangon
diff --git a/‎quick_sort/main.py
Lines changed: 30 additions & 17 deletions b/‎quick_sort/main.py
Lines changed: 30 additions & 17 deletions
diff --git a/‎quick_sort/quick_sort.py
Lines changed: 4 additions & 6 deletions b/‎quick_sort/quick_sort.py
Lines changed: 4 additions & 6 deletions
@@ -13,6 +13,27 @@ def is_sorted(numbers):
     return True
 
 
+def check_sort(original):
+    numbers = original[:]
+
+    qs = QuickSort(numbers)
+    output = qs.sort()
+
+    print(output)
+
+    if is_sorted(output):
+        print("** SUCCESS! **")
+    else:
+        print("Uh oh - not in order.")
+
+    if contain_same_ints(original, numbers):
+        print("** Contain the same elements! **")
+    else:
+        print("Uh oh - something is missing.")
+
+    print("---")
+
+
 def contain_same_ints(arr1, arr2):
     for i in arr1:
         found = False
@@ -24,29 +45,21 @@ def contain_same_ints(arr1, arr2):
 
     return True
 
+
 def main():
-    original = [325432, 989, 547510, 3, -93, 189019, 5042, 123,
+    check_sort([325432, 989, 547510, 3, -93, 189019, 5042, 123,
                 597, 42, 7506, 184, 184, 2409, 45, 824,
                 4, -2650, 9, 662, 3928, -170, 45358, 395,
-                842, 7697, 110, 14, 99, 221]
+                842, 7697, 110, 14, 99, 221])
 
-    numbers = original[:]
+    check_sort([9, 9, 9, 9, 9, 9, 9, 9, 9, 9])
 
-    qs = QuickSort(numbers)
-    output = qs.sort()
+    check_sort([3, 5, 7, 9, 23, 25, 34, 53, 77, 199])
 
-    if is_sorted(output):
-        print("** SUCCESS! **")
-    else:
-        print("Uh oh - not in order.")
-
-    if contain_same_ints(original, numbers):
-        print("** Contain the same elements! **")
-    else:
-        print("Uh oh - something is missing.")
-
-    print(output)
+    check_sort([3, 5, 7])
+    check_sort([3, 5])
+    check_sort([3])
 
 
 if __name__ == "__main__":
-    main()
+    main()
@@ -2,7 +2,6 @@
 
 
 class QuickSort(object):
-
     def __init__(self, numbers):
         self.values = numbers
         self.count = len(self.values)
@@ -22,16 +21,15 @@ def quick_sort(self, left, right):
 
         pivot = self.values[pivot_index]
 
-        while i <= j:
+        while i < j:
             while self.values[i] < pivot:
                 i += 1
             while self.values[j] > pivot:
                 j -= 1
             if i <= j:
-                if i < j:
-                    temp = self.values[i]
-                    self.values[i] = self.values[j]
-                    self.values[j] = temp
+                temp = self.values[i]
+                self.values[i] = self.values[j]
+                self.values[j] = temp
                 i += 1
                 j -= 1