Merge pull request #6999 from sulaemanahmed/patch-9

Update selection_sort.py

Author: ossamamehmood

Add Code Here/All_Sorting/selection_sort.py

@@ -1,21 +1,26 @@
-# Selection sort in Python
-# time complexity O(n*n)
-#sorting by finding min_index
+def selectionSort(array):
+    size = len(array)
+    for ind in range(size):
+        min_index = ind
 
-def selectionSort(array, size):
-	
-	for ind in range(size):
-		min_index = ind
+        for j in range(ind + 1, size):
+            # select the minimum element in every iteration
+            if array[j] < array[min_index]:
+                min_index = j
+        # swapping the elements to sort the array
+        (array[ind], array[min_index]) = (array[min_index], array[ind])
 
-		for j in range(ind + 1, size):
-			# select the minimum element in every iteration
-			if array[j] < array[min_index]:
-				min_index = j
-		# swapping the elements to sort the array
-		(array[ind], array[min_index]) = (array[min_index], array[ind])
+def main():
+    arr = []
+    n = int(input("Enter the number of elements: "))
+    for i in range(n):
+        element = int(input(f"Enter element {i+1}: "))
+        arr.append(element)
+
+    selectionSort(arr)
+    print('The array after sorting in Ascending Order by selection sort is:')
+    print(arr)
+
+if __name__ == "__main__":
+    main()
 
-arr = [-2, 45, 0, 11, -9,88,-97,-202,747]
-size = len(arr)
-selectionSort(arr, size)
-print('The array after sorting in Ascending Order by selection sort is:')
-print(arr)