Question

please help with python

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 4 6 Initial List Minimum Swaps Position: Sorted List Length 1 Minimum Swaps Position: Sorted List Length 2 3 4 Minimum Swaps Position: Sorted List Length 3 3 4 5 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

# Selection sort function definition. def SelectionSort (Count, List): i = 0 while i < Count: #while-loop for sorting. small = i for j in range (i + 1, len (List)): if List[small] > List[j]: small =) List[i], List[small] = List (small), List[i] i += 1; #Print sorted list using while-loop. print ("Sorted array:") i = 0 while i < Count: print (List[i]) i += 1 N - int (input('Enter number of elements to be sorted: ')) numbers = [] #List where numbers will be stored. #for i in range (N): i - 0 while i < N: n - int (input('Enter number to be sorted: ')) numbers.append(n) i = 1 #Caller for selection sort. SelectionSort (N, numbers)

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