Added simulation features in insertion & selection sorts (keon#333)

geon0325 · goswami-rahul · commit 5e08ff9c52b5 · 2018-06-08T11:47:18.000+05:30
* Added simulation feature

* Added simulation feature

* Update insertion_sort.py

* Update selection_sort.py

* Update insertion_sort.py

* Update selection_sort.py

* Update bubble_sort.py

* Update bubble_sort.py

* Update insertion_sort.py

* Update selection_sort.py
diff --git a/algorithms/sort/bubble_sort.py b/algorithms/sort/bubble_sort.py
@@ -17,8 +17,9 @@ def swap(i, j):
     n = len(arr)
     swapped = True
     
+    iteration = 0
     if simulation:
-        print(arr)
+        print("iteration",iteration,":",*arr)
     
     while swapped:
         swapped = False
@@ -27,6 +28,7 @@ def swap(i, j):
                 swap(i - 1, i)
                 swapped = True
                 if simulation:
-                    print(arr)
+                    iteration = iteration + 1
+                    print("iteration",iteration,":",*arr)
                     
     return arr
diff --git a/algorithms/sort/insertion_sort.py b/algorithms/sort/insertion_sort.py
@@ -1,15 +1,25 @@
-def insertion_sort(arr):
+def insertion_sort(arr, simulation=False):
     """ Insertion Sort
         Complexity: O(n^2)
     """
+    
+    iteration = 0
+    if simulation:
+        print("iteration",iteration,":",*arr)
+        
     for i in range(len(arr)):
         cursor = arr[i]
         pos = i
+        
         while pos > 0 and arr[pos - 1] > cursor:
             # Swap the number down the list
             arr[pos] = arr[pos - 1]
             pos = pos - 1
         # Break and do the final swap
         arr[pos] = cursor
+        
+        if simulation:
+                iteration = iteration + 1
+                print("iteration",iteration,":",*arr)
 
     return arr
diff --git a/algorithms/sort/selection_sort.py b/algorithms/sort/selection_sort.py
@@ -1,13 +1,23 @@
-def selection_sort(arr):
+def selection_sort(arr, simulation=False):
     """ Selection Sort
         Complexity: O(n^2)
     """
+    iteration = 0
+    if simulation:
+        print("iteration",iteration,":",*arr)
+        
     for i in range(len(arr)):
         minimum = i
+        
         for j in range(i + 1, len(arr)):
             # "Select" the correct value
             if arr[j] < arr[minimum]:
                 minimum = j
 
         arr[minimum], arr[i] = arr[i], arr[minimum]
+        
+        if simulation:
+                iteration = iteration + 1
+                print("iteration",iteration,":",*arr)
+            
     return arr
