Question

Question 5 (10 Points) Write a well-documented, Python program, hmwk305.py that implements the Selection-Sort algorithm. Selection-Sort segments the list into sorted and unsorted elements. The algorithm continues to remove the smallest element of the unsorted list and adds it to the sorted segment. Implement the algorithm that accepts an unsorted list and returns a sorted one - in ascending order. 5 3 8 Initial List 4 6 18 4 6 Minimum Swaps Position: Sorted List Length 1 Minimum Swaps Position: Sorted List Length 2 w 4 5 Minimum Swaps Position: Sorted List Length 3 3 4 5 6 Minimum Swaps Position 3 4 5 6 8 Sorted List Selection Sort Algorithm Hints: Convince yourself that the algorithm and Python implementation is correct by calling the sorting function with a list [50, 20, 10,80,40], and printing the sorted result. Your algorithm should use a while-loop to ensure that the ascending order is achieved. Grading: Comments (+2 points). Input software to query for a list of N elements (+4 points). A correct while-loop (+4 points).

Answer 1

All the explanation is in the code comments. Hope this helps!

Code:

# function to sort list using selection sort
def selectionSort(L):
  
# loop for all elements in list
for i in range(len(L)):
  
# find the minimum element in remaining unsorted array
min_idx = i
for j in range(i+1, len(L)):
# update minimum index, if required
if L[min_idx] > L[j]:
min_idx = j
  
# Swap the found minimum element with the first element
if(i != min_idx):
L[i], L[min_idx] = L[min_idx], L[i]
  
# sample run
L = [50, 20, 10, 80, 40]
print('Unsorted list:', L)
# call the selection sort function
selectionSort(L)
print('Sorted list:', L)

Sample run:

Unsorted list: (50, 20, 10, 80, 40] Sorted list: [10, 20, 40, 50, 80]

Code screenshot:

# function to sort list using selection sort def selectionSort(L): # loop for all elements in list for i in range(Len(L)): # find the minimum element in remaining unsorted array min_idx = i for j in range(i+1, len(L)): # update minimum index, if required if L[min_idx] > L[j]: min_idx = j # Swap the found minimum element with the first element if(i != min_idx): L[i], L[min_idx] = L[min_idx], L[i] # sample run L = [50, 20, 10, 80, 40] print('Unsorted list:', L) # call the selection sort function selectionSort(L) print("Sorted list:', L)

Answer 2

# 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]),