Run the code below to define the function# In[ ]:E def minIndexAfter (items, startPos) :minIndex = startPosi = startPos + 1while (i < len (items)) :if (items[i] < items[minIndex]):minIndex = ii = i + 1return minIndexDefine a function called `selectionSort` below. In the body of the function, you will need to call the `swapfunction and the `minlndexAfter` function.- Define 'selectionSort' hereitems = [395,2,-4,20, 47,200,-50,-12]selectionSort (items)print (items)Use the code above to test your 'selectionSort' function Run the code below to call the function# In[ ]:otherList = [395,2,-4,20,47,200,-50,-12] #a list for testingprint ('Before sorting: ', otherList)bubbleSort (otherList)print ('After sorting:', otherList)a) What are the contents of otherList after a single iteration of the outer loop of 'bubbleSort?b) How many iterations of the outer loop happen when sorting `otherList?* Then run both blocks of code (the def block and the test block) again.* Examine the output to answer the question about iterations.Create a new list below with * elements known as "yourList" - a list where you can get 'bubbleSort` to stopearly (do fewer iterations). How many times did the outer loop run for 'yourList?# In[ ]:yourList = [] #fill in this list with 8 elements separated by commasprint ('Before sorting:', yourList)bubbleSort (yourList)print ('After sorting:', yourList)

Note: As per our guidelines we are supposed to answer only one question. Kindly repost other…

# In[ ]: |def minIndexAfter (items, startPos): minIndex = startPos i = startPos + 1 while (i < len (items)): if (items [i] < items[minIndex]): minIndex = i i = i + 1 return minIndex Define a function called selectionSort below. In the body of the function, you will need to call the 'swap function and the 'minlndexAfter' function. - Define 'selectionSort' here items = [395,2,-4,20,47,200,-50,-12] selectionSort (items) print (items)

# In[ ]: |def minIndexAfter (items, startPos): minIndex = startPos i = startPos + 1 while (i < len (items)): if (items [i] < items[minIndex]): minIndex = i i = i + 1 return minIndex Define a function called selectionSort below. In the body of the function, you will need to call the 'swap function and the 'minlndexAfter' function. - Define 'selectionSort' here items = [395,2,-4,20,47,200,-50,-12] selectionSort (items) print (items)

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter17: Linked Lists

Section: Chapter Questions

Problem 18PE

See similar textbooks

Similar questions

Using the ListNode structure introduced in this chapter, write a function void printFirst(ListNode *ptr)that prints the value stored in the ﬁrst node of a list passed to it as parameter. The function should print an error message and terminate the program if the list passed to it is empty.
Write a function with below starting function: public static void printFirstAnd Last(ArrayList list) The approach should accomplish the following: Print "no elements" if the list is empty. Print the single element in the list if there is only one. Print the first entry in a list with more than one element, followed by a space, and then the last element.
Write the code of the following functions: def fillX(pointsX,lowerLimit, upperLimit): This function receives a list pointsX and returns the same list with values between loverLimit and upperLimit. There are number of them.
About initial programming in python: Create a function that receives as parameters a list of 4 elements [name,[phone(s)], email, instagram] and a phone number:• If the phone number is in the list, it must be removed.• If not, no updates will be made. Note: phone(s) is within another list. Your function should only return a Boolean value, indicating whether the change was made or not. To find out if the function did the phone deletion correctly, you should check the contents of the list with the contact details you used to test your function after executing it. In the image is the model of parameters, in this case the function must exclude from the list of 4 elements the indicated number '44322456' and return "True".
complete the following function. // It is the same as observeCounter except that f has a parameter of type List[Counter] not Counter. // f will insist that the List[Counter] has length 3. // You must return a List[Int] not an Int. // The first element of the result List[Int] must correspond to the number of times that increment/decrement were called on the first element of type List[Counter], similarly for the second and third elements. def observeCounterList (f : List[Counter] => Unit) : List[Int] = { // TODO: Provide definition here. List (-1, -1, -1) }
Write a function list2DigitOdd() that creates and returns a list that contain all positive 2-digit odd numbers. The function call list2DigitOdd() will return a list containing 11, 13, 15, ..., 99.
1- Programming Problem Part 1 Write a function that will have a list as an input, the task of the function is to check if all the elements in the list are unique,( i.e. no repetition of any value has occurred in the list), then the function returns true otherwise it returns false. Your program should include a main method that call the method to test it. (If you would use built-in functions in Python, use lists’ or dictionaries’ methods as we studied their time efficiency in class)
Write the function splitList that takes the first argument list and splits it into two: a list of all the elements that are less than the head (the second argument), and a list of all the elements that are greater than or equal to the head (the third argument): listElementT splitList(listADT list, listADT* ItList, listADT* geList); Note that the head is returned by the function. a) Write this function as a recursive function. b) Write this function as a nonrecursive function.
Most common names Write a function mostCommonName(L:List[str]) -> List[str] that takes a list of names (such as ["Jane", "Aaron", "Cindy", "Aaron"], and returns the most common name in this list (in this case, "Aaron"). If there is more than one such name, return a list of the most common names, in any order. That is, mostCommonName(["Jane", "Aaron", 'Jane", "Cindy", "Aaron"]) returns, for example, the list ["Aaron", "Jane" ]. If the input list is empty, return an empty list. Also, names are case- sensitive i.e. "Jane" and "JANE" are different names. assert set (mostCommonName(["Jane", "Aaron", "Jane", "Cindy", "Aaron"])) == set ( ["Ai assert set (mostCommonName(["A", "B", "C", "a", "B"])) set(["B"]) assert mostCommonName([]) == [] Your Answer: 1 # Put your answer here 2 Submit ==
Q1:Write a function that returns a new list by eliminating theduplicate values in the list. Use the following function header:def eliminateDuplicates(lst):Write a test program that reads in a list of integers, invokes the function,and displays the result. Here is the sample run of the program Enter ten numbers: 2 3 2 1 6 3 4 5 2The distinct numbers are: 1 2 3 6 4 5 Q2:Write a program that reads in your Q1 Pythonsource code file and counts the occurrence of each keyword in the file.Your program should prompt the user to enter the Python source code filename. This is the Q1: code: def eliminateDuplictes(lst):newlist = [] search = set() for i in lst: if i not in search: newlist.append(i) search.add(i) return newlist a=[] n= int(input("Enter the Size of the list:")) for x in range(n):item=input("\nEnter element " + str(x+1) + ":") a.append(item) result = eliminateDuplictes(a) print('\nThe distinct numbers are: ',"%s" % (' '.join(result)))
Code in python Given a list, L, the function front_two creates a new list of length 2 out of the first two items in L as follows: In the new list, the second item becomes the first item, and the first item becomes the second. If L contains only one item, the first item in the new list should be the value None. If L is empty, both items in the new list should be value None. The function returns the new list. For example: Test Result L = ['a', 'b', 'c', 'd'] print(front_two(L)) ['b', 'a'] L = [] print(front_two(L)) [None, None] L = [5, 2] print(front_two(L)) [2, 5] L = [7] print(front_two(L)) [None, 7]
8-9. Messages: Make a list containing a series of short text messages. Pass the list to a function called show_messages(), which prints each text message. 8-10. Sending Messages: Start with a copy of your program from 8-9. Write a function called send_messages() that prints each text message and moves each message to a new list called sent_messages as it’s printed. After calling the function, print both of your lists to make sure the messages were moved correctly. 8-11. Archived Messages: Start with your work from 8-10. Call the function send_messages() with a copy of the list of messages. After calling the function, print both of your lists to show that the original list has retained its messages. 8-12. Sandwiches: Write a function that accepts several items a person wants on a sandwich. The function should have one parameter that collects as many items as the function call provides, and it should print a summary of the sandwich that’s being ordered. Call the function three times,…