Update quick_sort.py (#830)

Modify the list comprehensions to reduce the number of judgments, the speed has increased by more than 50%.

Author: BruceLee569

sorts/quick_sort.py

@@ -34,8 +34,16 @@ def quick_sort(collection):
         return collection
     else:
         pivot = collection[0]
-        greater = [element for element in collection[1:] if element > pivot]
-        lesser = [element for element in collection[1:] if element <= pivot]
+        # Modify the list comprehensions to reduce the number of judgments, the speed has increased by more than 50%.
+        greater = []
+        lesser = []
+        for element in collection[1:]:
+            if element > pivot:
+                greater.append(element)
+            else:
+                lesser.append(element)
+        # greater = [element for element in collection[1:] if element > pivot]
+        # lesser = [element for element in collection[1:] if element <= pivot]
         return quick_sort(lesser) + [pivot] + quick_sort(greater)