Given the Selection Sort Algorithm covered in Module 07 B (c…

Given the Selection Sort Algorithm covered in Module 07 B (consider ascending order sorting, that is, smaller values are followed by larger values) and the list of integers called values given below, show how each of the next three passes of the algorithm changes the list values.  How many swaps did you make in total in these passes?   values = [-2, 0, 3, 9, 11, 5, 16]  

Write a Python program that contains a function called creat…

Write a Python program that contains a function called create_list that accepts two arguments: a list called values, and a number n. Assume that the list values contains numbers. The function should create and return a list of numbers in the values list that are greater than the number n. Call the create_list() function so that it can return all elements in the following list that are greater than 35. Print out the list of numbers that create_list() returns. numbers = [19, 22, 45, 36, 25, 44, 49, 29, 50, 47]