Design a more efficient version of HeapVector that keeps its values in order only when necessary: When values are added, they are appended to the end of the existing heap and a nonHeap flag is set to true. When values are removed, the nonHeap flag is checked and the Vector is heapified if necessary. What are the worst-case and best-case running times of the add and remove operations?

Design a more efficient version of HeapVector that keeps its values in order only when necessary: When values are added, they are appended to the end of the existing heap and a nonHeap flag is set to true. When values are removed, the nonHeap flag is checked and the Vector is heapified if necessary. What are the worst-case and best-case running times of the add and remove operations?

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 16PE: The implementation of a queue in an array, as given in this chapter, uses the variable count to...

See similar textbooks

Similar questions

Create a more efficient HeapVector that just keeps its values in order when necessary: When values are added to the heap, they are appended to the end of the existing heap and the nonHeap flag is set to true. When values are removed, the nonHeap flag is checked, and the Vector, if necessary, is heapified. What are the worst-case and best-case add and delete operation times?
Create a HeapVector that is more effective and only maintains the order of its values when necessary. Values are added by appending them to the heap's end and setting the nonHeap flag to true. The nonHeap flag is examined when values are removed, and the Vector is heapified if necessary. What are the add and delete operations' worst-case and best-case running times?
You may only operate on the stacks WORK and TEMP, supporting their ADT operations of PUSH (S, X), POP (S, X), and EMPTYSTACK (S), where X is an element or variable to be pushed into or popped out of the stack and S denotes the stack itself. If necessary to complete the procedures, you may also utilise one variable. i) How can you determine the least element that was pushed into WORK given n different random integers that are going be placed into it? You are allowed to employ a single variable. ii) How can you determine the maximum element that was put into Work, given n different random integers, while making sure that the items placed in Work are arranged in ascending order, with the maximum element starting at the bottom of the stack? You are allowed to utilise the temporary stack TEMP as well as a single variable. iii) How can you create the sorted list in the array using just stacks given an array A[1: n] of unique random numbers?
Create a birthday reminder system using a minheap such that theordering on the heap is done each day according to days remaining until the individual’s birthday. Keep in mind that when abirthday passes, the heap must be reordered.
You may only operate on the stacks WORK and TEMP, supporting their ADT operations of PUSH (S, X), POP (S, X), and EMPTYSTACK (S), where X is an element or variable to be pushed into or popped out of the stack and S denotes the stack itself. If necessary to complete the procedures, you may also utilise one variable.i i) I How can you determine the least element that was put into Work given n different random numbers? You may employ a single variable. ii) Given n distinct random numbers that are to be pushed into WORK, how canyou find the maximum element that was pushed into it, all the while ensuring thatthe elements stored in WORK are in their descending order with the maximumelement beginning at the bottom of stack? You are permitted to use a lone variableand a temporary stack TEMP.
Implement the STAQUE abstract data type, a linked stack and linked queue together. Create methods for performing the PUSHINS and POPDEL operations on a non-empty STAQUE, which stand for insert and delete operations, respectively.According to a directive supplied to the process, PUSHINS adds an element to the top or back of the STAQUE, and POPDEL removes items from the top or front of the list.
Implement a queue Q with two stacks S1 and S2 so that the stacks that work together as a queue may perform operations ENQUEUE(Q, X) and DEQUEUE(Q, Y), where Q is apparently a queue and X is the element to be inserted into Q and Y is the element removed from Q. Assume that the PUSH, POP, and EMPTYSTACK ADT operations are only accessible for stacks.Demonstrate the operation of your method on a list a, b, c, which will be used as a queue by the stacks S1 and S2.
Implement a queue with three stacks so that, in the worst-case scenario, each queue operation requires a fixed number of stack operations. High level of difficulty alert.
Implement a queue Q with two stacks S1 and S2, so that the stacks that operate together as a queue may perform the operations ENQUEUE(Q, X) and DEQUEUE(Q, Y), where Q appears to be a queue and X is the element to be inserted into Q and Y is the element to be removed from Q. Assume that the ADT operations PUSH, POP, and EMPTYSTACK are only available for stacks.Show how your technique works on a list a, b, c, which will be utilised as a queue by the stacks S1 and S2.
Implement a nonrecursive variant of quicksort based on a primary loop that pops a subarray from a stack to be partitioned and pushes the resulting subarrays back onto the stack. Note: Putting the bigger of the subarrays on the stack first ensures that the stack has no more than lg N elements.
Implement a heap and show how to insert, remove, and search on it.
You are implementing two queues for the same data set, one by using array and one by using linked list. Compare the operations of insertion and deletion of the elements for time and space complexity separately.