change variable

Muh. Angga Muttaqien · Muh. Angga Muttaqien · commit b0de76e735aa · 2017-08-27T04:11:39.000+07:00
diff --git a/sorting/bubble-sort.py b/sorting/bubble-sort.py
@@ -13,8 +13,8 @@ def bubble_sort(collection):
 
 def main():
     print("=== Bubble Sort (Algorithm) - A simple algorithm that repeatedly steps through the list to be sorted. The algorithm is named for the way smaller or larger elements 'bubble' to the top of the list")
-    numbers = raw_input("Enter numbers separated by a comma: ")
-    unsorted = [int(item) for item in numbers.split(',')]
+    user_input = raw_input("Enter numbers separated by a comma: ")
+    unsorted = [int(item) for item in user_input.split(',')]
     print(bubble_sort(unsorted))
 
 if __name__=='__main__':
diff --git a/sorting/insertion-sort.py b/sorting/insertion-sort.py
@@ -15,8 +15,8 @@ def insertion_sort(collection):
 
 def main():
     print("=== Insertion Sort (Algorithm) - An efficient, general-purpose, comparison-based sorting algorithm which most implementations produce a stable sort. Merge-sort is a divide and conquer algorithm")
-    numbers = raw_input("Enter numbers separated by a comma: ")
-    unsorted = [int(item) for item in numbers.split(',')]
+    user_input = raw_input("Enter numbers separated by a comma: ")
+    unsorted = [int(item) for item in user_input.split(',')]
     print(insertion_sort(unsorted))
 
 if __name__=='__main__':
diff --git a/sorting/merge-sort.py b/sorting/merge-sort.py
@@ -37,8 +37,8 @@ def merge_sort(collection):
 
 def main():
     print("=== Merge Sort (Algorithm) - An efficient, general-purpose, comparison-based sorting algorithm which most implementations produce a stable sort. Merge-sort is a divide and conquer algorithm")
-    numbers = raw_input("Enter numbers separated by a comma: ")
-    unsorted = [int(item) for item in numbers.split(',')]
+    user_input = raw_input("Enter numbers separated by a comma: ")
+    unsorted = [int(item) for item in user_input.split(',')]
     print(merge_sort(unsorted))
 
 if __name__=='__main__':
diff --git a/sorting/quick-sort.py b/sorting/quick-sort.py
@@ -14,8 +14,8 @@ def quick_sort(collection):
 
 def main():
     print("=== Quick Sort (Algorithm) - An efficient sorting algorithm, serving as a systematic method for placing the elements of an array in order. It is still commonly used algorithm for sorting which is faster than its main competitors, merge-sort and heap-sort")
-    numbers = raw_input("Enter numbers separated by a comma: ")
-    unsorted = [int(item) for item in numbers.split(',')]
+    user_input = raw_input("Enter numbers separated by a comma: ")
+    unsorted = [int(item) for item in user_input.split(',')]
     print(quick_sort(unsorted))
 
 if __name__=='__main__':
diff --git a/sorting/selection-sort.py b/sorting/selection-sort.py
@@ -17,8 +17,8 @@ def selection_sort(collection):
 
 def main():
     print("=== Selection Sort (Algorithm) - A sorting algorithm that has thime complexity, making it inefficient on large lists, and generally performs worse than the other similar sort")
-    numbers = raw_input("Enter numbers separated by a comma: ")
-    unsorted = [int(item) for item in numbers.split(',')]
+    user_input = raw_input("Enter numbers separated by a comma: ")
+    unsorted = [int(item) for item in user_input.split(',')]
     print(selection_sort(unsorted))
 
 if __name__=='__main__':
