Write a function insertionsort(somelist) that applies the insertion sort algorithm. (You should use the pop and insert commands) Insertion sort works as follows remove the first element from the original list (mylist) and add it to a new list sortedlist. Then repeat, at each stage removing the first element (call it x) from mylist and adding it to sortedlist. The challenge is that it needs to be added at the correct position, which means scanning through sortedlist for the first element bigger than x and inserting x just before that point, or if there is no such element then inserting x at the end. We recollect two useful list commands you should use in this code: • x = mylist.pop(0) which lets x be the entry at index 0 of mylist while also removing that entry from mylist. (Generally x = mylist.pop(j) works in the obvious way.) • sortedlist.insert(i,x) which changes sortedlist by inserting x into it at index i (with all entries with indices ≥ i having their indices increased by 1).

Write a function insertionsort(somelist) that applies the insertion sort algorithm. (You should use the pop and insert commands) Insertion sort works as follows remove the first element from the original list (mylist) and add it to a new list sortedlist. Then repeat, at each stage removing the first element (call it x) from mylist and adding it to sortedlist. The challenge is that it needs to be added at the correct position, which means scanning through sortedlist for the first element bigger than x and inserting x just before that point, or if there is no such element then inserting x at the end. We recollect two useful list commands you should use in this code: • x = mylist.pop(0) which lets x be the entry at index 0 of mylist while also removing that entry from mylist. (Generally x = mylist.pop(j) works in the obvious way.) • sortedlist.insert(i,x) which changes sortedlist by inserting x into it at index i (with all entries with indices ≥ i having their indices increased by 1).

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

(This if for mindtap on cengage, if not possible, use devc++ 5.11 but mindtap is more accurate) Write a C++ function, smallestIndex, that takes as parameters an int array and its size and returns the index of the first occurrence of the smallest element in the array. To test your function, write a main that prompts a user for a list of 15 integers and outputs the index and value of the first occurrence of the smallest value. An example of the program is shown below: (look at picture) You can use the following integer lists to test your code: 56, 34, 67, 54, 56, 87, 66, 92, 15, 32, 55, 54, 88, 92, 30 79, 26, 97, 87, 73, 44, 67, 46, 55, 13, 20, 20, 33, 42, 60 63, 1, 40, 81, 30, 11, 26, 44, 98, 1, 80, 98, 15, 3, 42
Below is the exercise for unsorted arrays. True or False: For each statement below, indicate whether you think it is True or False 3) For the insert function, if the array is empty, there are no comparison operations that need to be performed and you can immediately add the new element 5) Because the update algorithm depends on using linear search, its performance is O(1) in the worst case scenario 6) If you search for and delete an element in an unsorted array and then shift the rest of the elements to fill the hole, the worst case performance is O(n) 7) If you search for and delete an element in an unsorted array and then move the last element to fill the hole, the worst case performance is O(n)
create an array of 30 random numbers that range between 1and 100. And yet again, write a function that will receive a number from the userand determine if that number exists in the array or not. But this time, start bySORTING your input list. After a sort, the list in problem 1 is as follows:[2, 2, 3, 5, 12, 14, 14, 15, 23, 36, 39, 41, 44, 44, 45, 48,49, 50, 52, 52, 59, 71, 81, 82, 88, 89, 89, 93, 96, 97] Approach: Implement a method called findC(x, A, i, j), where x is the number we arelooking for in array A, the first index of the array is i and the last index is j. We wantto determine whether x exists in A anywhere between index i and index j. Your firstcall to this method will therefore look like this: findC(x, A, 0, A.length-1). In the body of your function, compare x with the item that is in the middle of thearray, as you did before. As before, call the middle of index of the array mid. But thistime, if x<=a[mid], recursively call your function to search ONLY the first half of…
Provide an explanation that justifies the running time of each function in terms of n, where n is the number of students in the list. You can assume the name of each student is of length O(1). HERE ARE THE FUNCTIONS FOR YOU TO EXPLAIN THE RUNNING TIME OF: FUNCTION 1: bool insert_student(int id, char name[], struct slist* lst) { char* studentName = find_student(id, lst); if (studentName == NULL) { // no student with the given id is found, // so we can perform insertion here // creating a new student node struct snode* new_node = (struct snode*) malloc(sizeof(struct snode*)); new_node->id = id; new_node->name = (char*) malloc(strlen(name)*sizeof(char)); strcpy(new_node->name, name); new_node->next = NULL; // if the first node is null if (lst->front == NULL) { lst->front = new_node; } else { struct snode* prevNode = NULL; struct snode* nextNode = lst->front; bool is_node_inserted = false; do { if (id < nextNode->id) { if (prevNode == NULL) { // new…
Implement the insertionSort function and modify the quicksortHelper() function so that it calls insertion sort to sort any sublist whose size is less than 50 items. Compare the performance of this version with that of the original one, using data sets of 50, 500, and 5000 items. Afterwards, adjust the threshold for using the insertion sort to determine an optimal setting based on your findings from the step above. To test your program run the main() method in the testquicksort.py file.
7) Use a counting sort on a set of keys that fall between (a, b), where a and b are modest positive numbers that the user inputs. 8) For an acceptable selection of the number of buckets, implement bucket sort with an array of lists data structure to sort a list of characters, a list of floating point values, and a list of uniformly distributed integers.
Write a Python function `removeDuplicates(myList)` that removes duplicate values from a list. While the algorithm for this problem might seem trivial, its implementation is not. In general, it is not advisable to modify a list while you are iterating on it, as in the following pseudo-code: for element in myList: if <condition>: <remove element(s) from myList> # recipe for disaster
Implements clone which duplicates a list. Pay attention, because if there are sublists, they must be duplicated as well. Understand the implementation of the following function, which recursively displays the ids of each node in a list Develop your solution as follows: First copy the nodes of the current list (self) Create a new list with the copied nodes Loop through the nodes of the new list checking the value field If this field is also a list (use isinstance as in the show_ids function) then it calls clone on that list and substitutes the value. Complete the code: def L4(*args,**kwargs): class L4_class(L): def clone(self): def clone_node(node): return <... YOUR CODE HERE ...> r = <... YOUR CODE HERE...> return r return L4_class(*args,**kwargs)
For this exercise, a list of non-negative numbers will be given, for which the following operation can be done: subtract 1 from two contiguous elements from the list. It must say whether after any number of operations the list can be converted to a list of zeros. EntryThe input will be a list of non-negative integers x_i such that 0 <= x_i <= 2000000000. ". DepartureIf the given list can be converted to a list of zeros with the operation defined above, print "YES", otherwise, print "NO". Examples Input Example 1 1 2Output Example 1 NOT Input Example 2 2 4 2Output Example 2 YES
Write in C++ Now, what if Sam wants to insert Eevee after Pikachu but he doesn't know where Pikachu is located in his list. Let's help him search for a Pokemon by its name and insert another Pokemon directly after it. Write a function secondPlace() that takes six parameters and inserts a new Pokemon into a list right after another specified pokemon. Once you find the specified Pokemon, use the insertAfter() function from the previous sub-question to add the new Pokemon. The function should return the new number of strings in the array. Note The same Pokemon may appear in the list multiple times (Sam has a bad memory). Assume that Sam wants every instance of the Pokemon he is searching for to be followed by the Pokemon he is attempting to insert. If the array is already full or if the number of strings that are going to be added to the array plus the current number of strings exceeds the total size of the array, the array should remain unchanged. Assume all inputs are lowercase…
(This question is for a linked list of the type described on the front page, Item 5). Write a recursive function CountGE60. that receives a linked list (may or may not be empty) and returns the number of nodes (each containing a data item value) greater than or equal to 60.
2.) Revise the function quickSort so that it always chooses the last item in the array as the pivot. Add a counter to the function partition that counts the number of comparisons that are made. Compare the behavior of the revised function with the original one (pivot should be selected using sortFirstMiddleLast algorithm), using arrays of various sizes. At what size array does the difference in the number of comparisons become significant? For which pivot selection strategy does the difference in the number of comparisons become significant? Compare your analysis with the actual running times and counter as a function of the input size n = 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 8192, 16384 <time.h> and clock() function. For comparison, you need to create two tables for execution times and a counter for both algorithms