5. There are 9, 5, 3, 6, 8, 4, 2, 1, 7 sequences, which need to be sorted from small to large to complete the following problems: 1) Write the results of the first round of quick sorting. 2) Write out the result of heap creation in heap sorting. 3) Write the results of the first round after sorting by the pairwise merging algorithm.

5. There are 9, 5, 3, 6, 8, 4, 2, 1, 7 sequences, which need to be sorted from small to large to complete the following problems: 1) Write the results of the first round of quick sorting. 2) Write out the result of heap creation in heap sorting. 3) Write the results of the first round after sorting by the pairwise merging algorithm.

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

1. Given the unsorted array write the pseudo code so sort it and find a specific element x a. Find (array, x) //first sort the array //search for element x using binary search 2. Given the following stack A = { 29,18,10,15,20,9,5,13,2,4,15} Create a queue by taking the elements from the top of the stack and adding them to a queue 3. what are the worst-case, average-case, and best-case complexities of insertion-sort, merge-sort, and quiksort 4. Given the following array A = {3,13,89,34,21,44,99,56,9} Illustrate the execution of the sorting algorithms on the given array: * Merge-sort algorithm * Quicksort (using the median-of-three pivot) algorithms * Selection Sort algorithm For each fundamental iteration or recursion of the algorithm, write the content of the array. 5. Evaluate the following postfix expression made using a stack: 234*5*-
1. Heap and Heapsort. (a) Run Build-Heap on the array [10, 9,4,7,6,2,3,1, 8,5] to construct a min heap. Write down the resulting array. Then, run the loop in Heapsort for three iterations. For each iteration write down the array after Heapify-Down is finished. You do not need to show intermediate steps. (b) Show that the leaves of a heap occupy the positions [],...,n-1 of the array. (c) In the procedure Build-Heap, why do we decrease i from [2]-1 to 0 instead of increasing from 0 to [2]-1? Give an example array where increasing i fails to create a valid min heap.
5) Sort the list A[]={ 20, 13,4, 34, 5, 15, 90, 100, 75, 1} by application of Heap Sort (Insert the elements of the array into a Minheap one by one using the Insert function and then delete them from the Minheap into the same array using the Delete function.) Just show the steps and no need to write any algorithm.
Consider the Stack ADT: Stack: push(x) adds x to top of stack pop() removes top element of stack and returns it size() returns number of elements in stack Select all options that allow for an efficient implementation based on the discussions from class. For any array implementation, you can assume the array is large enough so that making a larger one is not needed when pushing an item to the stack. Using an array with the top at the front of the array. Using an array with the top at the back of the array. Using a singly linked list with the top at the head of the list. Using a singly linked list with the top at the tail of the list. ENG
Stack: push(x) adds x to top of stack pop() removes top element of stack and returns it size() returns number of elements in stack Select all options that allow for an efficient implementation based on the discussions from class. For any array implementation, you can assume the array is large enough so that making a larger one is not needed when pushing an item to the stack. Using an array with the top at the front of the array. Using an array with the top at the back of the array. Using a singly linked list with the top at the head of the list. Using a singly linked list with the top at the tail of the list. None of these choices allows for an efficient implementation of all methods.
Towers of Hanoi. There is a story about Buddhist monks who are playing this puzzle with 64 stone disks. The story claims that when the monks finish moving the disks from one post to a second via the third post, time will end. Eschatology (concerns about the end of time) and theology will be left to those better qualified; our interest is limited to the recur- sive solution to the problem. A stack of n disks of decreasing size is placed on one of three posts. The task is to move the disks one at a time from the first post to the second. To do this, any disk can be moved from any post to any other post, subject to the rule that you can never place a larger disk over a smaller disk. The (spare) third post is provided to make the solution possible. Your task is using c++ write a recursive function that describes instructions for a solution to this problem. We don’t have graphics available, so you should output a sequence of instructions that will solve the problem. Hint: If you could…
Plaease give me the answer with proper solution Use the bubble sort method to show the first pass of the following array: Element Values 1 15 2 23 3 17 4 12 5 65 2. (True/False) 1. Stack has two pointers for controlling push and pop False 2. Queue has one pointer for controlling push and pop False 3. The name of the operation that can be done on queue are add and delete True 4. Write pseudo code to use stack to find out the factorial of an integer (x) 5. Write a pseudo code to use queue to store prime factors of an integer number (x)
4. Assume X = {3,4,6,9,8,7,16,15,20,19} is an array representation of a binary heap, such that each element in X represents a node on the heap. Delete one node from the heap. After the deletion, the root node of the tree representing the heap is node The left child of the root node is node and the right child of the root node is node . The right child of node 8 is node A Que
Heapsort analysis in python or java implement the Heapsort algorithm. Include a counter so at the end of the execution of the algorithm the number of operations carried out is displayed. also design two test cases: best and worst case. Explain why they represent these cases. Run the implemented algorithm for the best case and display the number of operations performed. Run the implemented algorithm for the worst case and display the number of operations performed. You must implement the algorithm, do not use a pre-implemented function. Thanks in advance!
1) Write the algorithm to solve the N-Queens problem. For example N = 4 2) Write differences between Min heap and Max heap.
USING C LANGUAGE IN NETBEANS : Write a program menu that creates and manages Fibonacci heaps. The program must implement the following operations: creation, insertion, find min, extract min, decrease key, and deletion. **NOTE: The program should present a menu where user may choose from implemented options.
Push 13 to the following min-heap and write the resulting heap array in the answer space. Write the array like a normal C++ array (e.g.: {67, 54, 123, ...}). 54 51 62 27 59 12pt ✓ Paragraph 28 ⠀ 50 Edit View Insert Format Tools Table 3 44 22 24