[Problem description] Give the union of two ordered lists. The maximal number of elements in an inputted set is 30. [Basic requirements] 1) Use sequential linear list. 2) The result list should also be ordered. [Example] Problem: Give the union of the ordered lists (3,4,9,100,103) and (7,9,43,53,102,105). What you need to show in the terminal(the back part is outputted by you and the blue part is inputted by the user, i.e., teacher): Please input the first ordered list: (3,4,9,100,103)Please input the second ordered list: (7,9,43,53,102,105) The union is: (3,4,7,9,9,43,53,100,102,103,105)

[Problem description] Give the union of two ordered lists. The maximal number of elements in an inputted set is 30. [Basic requirements] 1) Use sequential linear list. 2) The result list should also be ordered. [Example] Problem: Give the union of the ordered lists (3,4,9,100,103) and (7,9,43,53,102,105). What you need to show in the terminal(the back part is outputted by you and the blue part is inputted by the user, i.e., teacher): Please input the first ordered list: (3,4,9,100,103)Please input the second ordered list: (7,9,43,53,102,105) The union is: (3,4,7,9,9,43,53,100,102,103,105)

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 1TF

See similar textbooks

Similar questions

Python program- implement a singly linked list with following functions: - add_head(e) - add_tail(e) - find_3rd_to_last() - returns element located at third-to-last in the list - reverse() - reveres the linked list, note, this is not just printing elements in reverse order, this is actually reversing the list
Answer (iii) with detailed and concise explanations. Give the content of the stack after each of the following operations takes place.
- Create algorithm for operation of push and pop in stack, and explain its complexity
PROVIDE PYTHON CODE AND SCREENSHOT OF OUTPUT Create a doubly linked list that performs the following: delete at given position, insert at end, traverse in reverse direction.
ALGORITHM Steps: For Array/List Based, Declare and initialize necessary variables, eg size. Initialize an empty list as myStack; 1.Use while loop to get input from user. 2.Continue while loop until list size and defined size are same; if len(list) == size print “Stack overflow“ else Read item from user myStack = item 3.For next append operation, goto step 4.For pop operation, checks that your defined size is equal to list size or not; if len(list) == size print "Stack underflow" else myStack = pop(); Display item 5.For next pop operation, goto step 6.Stop Modify the algorithm given, stack.py, to create a Menu that enable user to enter option for stack operations append() pop() Count last item of the list len(list) == 0 and check whether list is full or not len() print() Note: Modify append() function so that it will enable you to push more items using (Y/N): E.g Enter your Choice: 1 Push item to stack: 12 Enter more(y/n): y Push item to stack: 15 Enter…
a. What is the efficient method for “array resizing” implementation of the stack in “push” and “pop” cases? b. The following is the postfix evaluation code for your reference. Explain the stack status for evaluating the following postfix expression 3 4 5 + *
Solve the following unsorted list: 9,36,4,69,24,16,91,2,45,13,7 Selection Sort
ALGORITHM Steps: For Array/List Based, Declare and initialize necessary variables, eg size. Initialize an empty list as myStack; 1.Use while loop to get input from user. 2.Continue while loop until list size and defined size are same; if len(list) == size print “Stack overflow“ else Read item from user myStack = item 3.For next append operation, goto step 2. 4.For pop operation, checks that your defined size is equal to list size or not; if len(list) == size print "Stack underflow" else myStack = pop(); Display item 5.For next pop operation, goto step 4. 6.Stop Modify the algorithm given, stack.py, to create a Menu that enable user to enter option for stack operations append() pop() Count last item of the list len(list) == 0 and check whether list is full or not len() print() Note: Modify append() function so that it will enable you to push more items using (Y/N): E.g Enter your Choice: 1 Push item to stack: 12 Enter more(y/n): y Push item to…
7. For a given input array, write a code in c or c++ to construct a Max-Heap using the following algorithms.The code should use inherently the same algorithms which were discussed in the class. (a) Build-Max-Heap(b) Max-Heap-Insert
Let xHead, yHead and zHead be the head pointers of 3 linked lists of integers (called X-list, Y-list and Z-list, respectively, from here). X-list and Y-list are each sorted (in non-decreasing order) in itself and each may be empty. Z-list is initially empty (i.e., zHead initially contains the null pointer). Develop and test a recursive C++ function called SortedMergeRecur that combines the nodes in X-list and Y-list into Z-list such that, after calling the function, Z-list is a sorted list (in non-decreasing order) containing all the nodes initially contained in X-list and Y-list – X-list and Y-list should both be empty after the call. Other specifications/requirements: ● Each node of the list has the following structure: struct Node{ int data; Node *link;}; ● The function should: ► Have only three parameters (each a pointer-to-Node) and no return value (be a void function). ► Not use any global variables or static local…
C++ code in Heap Sort using Linked List, In Ascending and Descending Order, User Input
SOLVE THE MAZE FUNCTION USING STACK.PLEASE ONLY C CODE,DONT USE C++ AND C#. /* R\C 0 1 2 3 4 5 6 7 *//* 0 */ {0, 0, 0, 1, 0, 0, 0, 0},/* 1 */ {0, 1, 1, 1, 0, 0, 1, 0},/* 2 */ {0, 1, 0, 1, 0, 0, 1, 0},/* 3 */ {0, 1, 0, 1, 1, 1, 1, 0},/* 4 */ {0, 1, 0, 0, 0, 0, 1, 1},/* 5 */ {0, 1, 1, 0, 1, 1, 1, 0},/* 6 */ {0, 0, 0, 0, 1, 0, 0, 0},/* 7 */ {0, 0, 0, 0, 1, 0, 0, 0}, #include <stdio.h>#include <stdlib.h>#include <string.h> typedef struct LINKED_STACK_NODE_s *LINKED_STACK_NODE; typedef struct LINKED_STACK_NODE_s{LINKED_STACK_NODE next;void *data;} LINKED_STACK_NODE_t[1]; typedef struct LINKED_STACK_s{LINKED_STACK_NODE head;int count;} LINKED_STACK_t[1], *LINKED_STACK; typedef struct{int R;int C;} POS_t[1], *POS; LINKED_STACK stack_init();void stack_free(LINKED_STACK stack);void stack_push(LINKED_STACK stack, void *data);void *stack_pop(LINKED_STACK stack);void *stack_top(LINKED_STACK stack);int is_empty(LINKED_STACK stack); int is_empty(LINKED_STACK stack){return…