From 8cb7d7880fb031cc6cd08f2d5d8e1da7f968d66a Mon Sep 17 00:00:00 2001 From: Nikhil Shrivastava Date: Tue, 1 Oct 2019 22:10:07 +0530 Subject: [PATCH] Updated --- sorting/selection.py | 23 +++++++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 sorting/selection.py diff --git a/sorting/selection.py b/sorting/selection.py new file mode 100644 index 0000000..a156da2 --- /dev/null +++ b/sorting/selection.py @@ -0,0 +1,23 @@ +# Python program for implementation of Selection +# Sort +import sys +A = [64, 25, 12, 22, 11] + +# Traverse through all array elements +for i in range(len(A)): + + # Find the minimum element in remaining + # unsorted array + min_idx = i + for j in range(i+1, len(A)): + if A[min_idx] > A[j]: + min_idx = j + + # Swap the found minimum element with + # the first element + A[i], A[min_idx] = A[min_idx], A[i] + +# Driver code to test above +print ("Sorted array") +for i in range(len(A)): + print("%d" %A[i]), \ No newline at end of file