Update Selection_Sort

Author: printdhruv

Selection_Sort

@@ -6,9 +6,11 @@
 #  Problem        =>
 #                       Implementation of Selection - sort
 #  Thoughts       =>
-#                       Insertion sort pick minimum element from range [i+1..N] and swap it with the
+#                       Insertion sort pick minimum element from range [i+1..N]
+#                       and swap it with the
 #                       ith element with reference to the outer loop.
-#                       The algorithms sort the numbers in place so the space - Complexity will
+#                       The algorithms sort the numbers in place so the space -
+#                       Complexity will
 #                       be O(1) just like the insertion sort.
 #  Time - Complexity =>
                         Best     -  Ω(n)
@@ -20,38 +22,50 @@
 """
 import random
 import time
-def selection_Sort(x):                             
-    l = []
-    for j in range(x):
-        l.append(random.randint(-9999, 9999))  
-    N = len(l)
-    start_time = time.time()
-    for i in range(0,N-1):
-      min = l[i]
-      index = i
-      flag = False
-      for j in range(i+1,N):
-        if l[j] < min:
-          min = l[j]
-          index = j
-          flag = True
-      if flag:
-        temp = l[i]
-        l[i] = min
-        l[index] = temp
-    return time.time() - start_time            
 
-print("The round-time elapsed to sort 1000 elements by selection sort ", round(selection_Sort(1000)))
-print("The round-time elapsed to sort 2000 elements by selection sort ", round(selection_Sort(2000)))
-print("The round-time elapsed to sort 4000 elements by selection sort ", round(selection_Sort(4000)))
-print("The round-time elapsed to sort 8000 elements by selection sort ", round(selection_Sort(8000)))
-print("The round-time elapsed to sort 16000 elements by selection sort ", round(selection_Sort(16000)))
+
+def Selection_Sort(noOfElements):
+    listOfElements = []
+    for i in range(noOfElements):
+            listOfElements.append(random.randint(0, 10))
+    listOfElements.sort()
+    listOfElements.reverse()
+#   print("Before sorting",listOfElements)
+    start = time.time()
+    for i in range(noOfElements - 1):
+        key = listOfElements[i]
+        j = i + 1
+        for k in range(j, noOfElements):
+            if listOfElements[k] < key:
+                key = listOfElements[k]
+                index = k
+                listOfElements[i], listOfElements[index] =
+                listOfElements[index], listOfElements[i]
+        # print("For ith loop ",i , listOfElements)
+    # print("After Sorting", listOfElements)
+    end = time.time()
+    return end - start
+
+print (
+      "Time taken to sort 4000   elements with Selection_Sort ",
+      round(Selection_Sort(4000))
+      )
+print (
+      "Time taken to sort 8000   elements with Selection_Sort ",
+      round(Selection_Sort(8000))
+      )
+print (
+      "Time taken to sort 16000  elements with Selection_Sort ",
+      round(Selection_Sort(16000))
+      )
+print (
+      "Time taken to sort 32000  elements with Selection_Sort ",
+      round(Selection_Sort(32000))
+      )
 
 '''
-Output :-
-                        The round-time elapsed to sort 1000 elements by selection sort  0
-                        The round-time elapsed to sort 2000 elements by selection sort  0
-                        The round-time elapsed to sort 4000 elements by selection sort  1
-                        The round-time elapsed to sort 8000 elements by selection sort  4
-                        The round-time elapsed to sort 16000 elements by selection sort  17
+    Time taken to sort 4000   elements with Selection_Sort  1
+    Time taken to sort 8000   elements with Selection_Sort  4
+    Time taken to sort 16000  elements with Selection_Sort  16
+    Time taken to sort 32000  elements with Selection_Sort  67
 '''