Write a function to sort a linked list of integers as follows: a) Find the largest value in the list. (the student should implement this function) b) delete it from its position and insert it at the head of the list. c) starting from what is now the second element, repeat (a) and (b). d) starting from what is now the third element, repeat (a) and (b). Continue until the list is sorted. please answer it in C++

Write a function to sort a linked list of integers as follows: a) Find the largest value in the list. (the student should implement this function) b) delete it from its position and insert it at the head of the list. c) starting from what is now the second element, repeat (a) and (b). d) starting from what is now the third element, repeat (a) and (b). Continue until the list is sorted. please answer it in C++

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 5PE

See similar textbooks

Similar questions

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)
We have a list. For example [2,4,6,6,8,2,12,54,15]. Without repeating the elements in the list a new list that does not repeat its elements by creating and using the function that writes Create.
python programming Write a function that will insert a new value into the middle of a Linked List. INPUT: The head of the Linked List, the value to insert OUTPUT: Nothing is output RETURNED: Nothing is returned
Imagine we have a linked list as shown below. The ListNodehas two fields: num, an integer, and next, a pointer to the next node. The list is not sorted. Write the definition of a function that calculates and returns the sum of the numbers in the list.
Write a function that changes the places of the first and second nodes of a linked list. I.e. the First node will become the second node, and the second node will become the first node. THE FUNCTION WILL NOT EXCHANGE DATA, IT WILL CHANGE LINKS.
Write a program in c++ and make sure it works, that reads a list of students (first names only) from a file. It is possible for the names to be in unsorted order in the file but they have to be placed in sorted order within the linked list.The program should use a doubly linked list.Each node in the doubly linked list should have the student’s name, a pointer to the next student, and a pointer to the previous student. Here is a sample visual. The head points to the beginning of the list. The tail points to the end of the list. When inserting consider all the following conditions:if(!head){ //no other nodes}else if (strcmp(data, head->name)<0){ //smaller than head}else if (strcmp(data, tail->name)>0){ //larger than tail}else{ //somewhere in the middle} When deleting a student consider all the following conditions:student may be at the head, the tail or in the middleBelow, you will find a sample of what the file looks like. Notice the names are in…
Write a Python Code for the given function and conditions: Given function: def insert(self, newElement) Pre-condition: None. Post-condition: This method inserts newElement at the tail of the list. If an element with the same key as newElement already exists in the list, then it concludes the key already exists and does not insert the key.
Write your own functions to create, insert nodes (both from the front and the end of the list), delete nodes, count the number of nodes, display all the nodes, display a specific node for the linked list. C++ and Java
Implement a function to insert a node at the end of a doubly linked list. Explain the steps involved and analyze the time complexity of your implementation.
Write the code to delete a node in the middle of a list implemented as a linked list with the dummy node (see Exercise 3). Compare your answer with the answer to Exercise 3. Are they the same? What do you conclude? Does the dummy node simplify the operation on the list? How?
Consider a (singly) linked list. Describe an algorithm to remove every second element from the list. (HINT: The algorithm is similar to the one that is used when we delete a single node. Here, we need to skip an element after every deletion, and then if we have not reached the end of the list repeat this procedure until the list is exhausted.). (a) Write the steps to removeEverySecondElement from the linked list. (b) Write a function removeEverySecondElement() that implements the task
Old MathJax webview Old MathJax webview In Java Some methods of the singly linked list listed below can be implemented efficiently (in different respects) (as opposed to an array or a doubly linked list), others not necessarily which are they and why? b. Implement a function to add an element before the first element. c. Implement a function to add an item after the last one element. d. Implement a function to output an element of the list. e. Implement a function to output the entire list. f. Implement a function to output the number of elements. G. Implement a function to delete an item. H. Implement a function to clear the entire list. I. Implement functionality to search for one or more students by first name, last name, matriculation number or course of study. J. Implement functionality to sort the records of the student, matriculation number and course according to two self-selected sorting methods.