Skip to content

Update SelectionSort.py #45

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
Nikitapande wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Update SelectionSort.py #45

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
38 changes: 22 additions & 16 deletions Sorting/SelectionSort.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -5,23 +5,29 @@
# Average Time Complexity: O(n^2)
# Best Time Complexity: O(n^2)

print("Number Sequence Before Selection Sort")
seq=[5,2,1,8,3,5,3]
print(seq)
# Python program for implementation of Selection
# Sort
import sys
A = [64, 25, 12, 22, 11]

def selectionSort(nums):
n=len(nums)
for i in range(n-1):
iMin=i
for j in range(i+1,n):
if(nums[iMin]>nums[j]):
iMin=j
temp=nums[i]
nums[i]=nums[iMin]
nums[iMin]=temp
return nums
# 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]),

print("Number Sequence After Selection Sort")
print(selectionSort(seq))