first part

def selectionSort( theSeq ): n = len( theSeq ) for i in range( n - 1 ):

 # Assume the ith element is the smallest. 

smallNdx = i

 # Determine if any other element contains a smaller value. 

for j in range( i + 1, n ): if theSeq[j]

smallNdx = j

# Swap the ith value and smallNdx value only if the smallest value is # not already in its proper position. Some implementations omit testing # the condition and always swap the two values. if smallNdx != i :

tmp = theSeq[i] theSeq[i] = theSeq[smallNdx] theSeq[smallNdx] = tmp 

# theSeq[i], theSeq[smallNdx] = theSeq[smallNdx], theSeq[i]

second part

# Sorts a sequence in ascending order using the insertion sort algorithm.

def insertionSort( theSeq ): n = len( theSeq ) # Starts with the first item as the only sorted entry. for i in range( 1, n ) : # Note that we start from index 1, not 0!

 # Save the value to be positioned. 

value = theSeq[i] # "Next value on top of the card deck" # Find the position where value fits in the ordered part of the list. pos = i while pos > 0 and value

 # Shift the items to the right during the search. 

theSeq[pos] = theSeq[pos - 1] pos -= 1

 # Put the saved value into the open slot. 

 theSeq[pos] = value 

Test the implementation of the selectionSort() function in Listing 5.6 (page 137) in your book. Demonstrate with several examples that the function behaves as expected. Question 4 Test the implementation of the insertion Sort() function in Listing 5.7 (page 140) in your book. Demonstrate with several examples that the function behaves as expected