int[] sort(); // Not quite a heap sort but almost. // This method should make a new array of elements to return, // and the elements in the new array should be the same values // that are in the heap, but in sorted order, smallest to largest. // Start the new returned array at slot 0, so in the returned array // slot 0 will have the smallest element from the heap... and // then up from there. //Min-heap example: // Suppose we have the following min-heap: // 3, 5, 4, 12, 6, 9 // sort() would return an array containing 3,4,5,6,9,12. return a new array with the elements from the orignal array in asending order

int[] sort(); // Not quite a heap sort but almost. // This method should make a new array of elements to return, // and the elements in the new array should be the same values // that are in the heap, but in sorted order, smallest to largest. // Start the new returned array at slot 0, so in the returned array // slot 0 will have the smallest element from the heap... and // then up from there. //Min-heap example: // Suppose we have the following min-heap: // 3, 5, 4, 12, 6, 9 // sort() would return an array containing 3,4,5,6,9,12. return a new array with the elements from the orignal array in asending order

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

void stack::do(){ for(int i=0li<=topindex/2;i++){ T temp=entry[i]; entry[i]=entry[topindex-i-1]; entry[topindex-1-i]=temp;} } Assume the stack is array based. What is this method do? a. swap the first item with last item b. doesn't do any thing c. replace each item with next item value d. reverse the stack
Exercise 1:In this problem, we would like to implement a variation of the Bubble Sort algorithm. The algorithm differs from a bubble sort in that it sorts in both directions on each pass through the list. The algorithm is illustrated as in the following figure: For the first step, we perform bubble sort from the index 1 to n (n is thenumber of elements in the array). The next step, we perform a reserved bubble sort from the index n to 1. The process is repeated until all the array is sorted. Propose a pseudo-code to complete the Bubble Sort algorithm. Implement and test this algorithm in C/C++. Analyze and compute the complexity of this algorithm in the best, average and worst scenarios.Exercise 2:Re-implement Exercise 1 using a linear data structure: List, Stack, Queue. Justify your choice of data structure.
Computer Science
slecetion sort (python) Selection sort is a sorting algorithm, like Bubble sort which you saw in the previous module. Selection sort works as follows: Selection sort divides the input list into two parts: a sublist of sorted items (left part) and a sublist of still unsorted items (right part). Initially, the sorted sublist is empty and the whole input consists of the unsorted sublist. To fill the sorted sublist, the algorithm computes the (index of) the minimum of the unsorted sublist and swaps the first unsorted element and the minimum element (if the minimum is already the first element, nothing happens). Afterward, the sorted sublist is one bigger. This continues until the unsorted sublist is empty and the entire input is sorted. Example: Sorted sublist Unsorted sublist Least element in unsorted list () (11, 25, 12, 22, 64) 11 (11) (25, 12, 22, 64) 12 (11, 12) (25, 22, 64) 22 (11, 12, 22) (25, 64) 25 (11, 12, 22, 25) (64) 64 (11, 12, 22, 25, 64) () Implement this…
The array below is used to store the values from a Heap. What would be the content of the array after we remove the maximum value ? Index 1 2 3. 4 6. 7 8. 9. 10 11 12 13 Value 79 77 57 38 59 22 32 1 12 41 26
Heapsort has heapified an array to: 63 50 37 26 89 and is about to start the second for loop. What is the array after each loop iteration? i = 4: Ex: 86, 75, 30 i = 3: i = 2: i = 1:
Please answer it in Python Sorting a list is to take the minimum and put it at the beginning, then start again with the second smallest, etc. min in final order remaining entries Write a function sort card that sorts an integer list by successive selections of the smallest element of the unsorted part of the list. For example: [1,-12, 19, 0] #return [-12, 0, 1, 19] [5, 4, 3, 2, 1] # return [1, 2, 3, 4, 5]
Sorting One common task for computers is to sort data. For example, people might want to see all their files on a computer sorted by size. Since sorting is a simple problem with many different possible solutions, it is often used to introduce the study of algorithms. Insertion Sort These challenges will cover Insertion Sort, a simple and intuitive sorting algorithm. We will first start with a nearly sorted list. Insert element into sorted list Given a sorted list with an unsorted number e in the rightmost cell, can you write some simple code to insert e into the array so that it remains sorted? Since this is a learning exercise, it won't be the most efficient way of performing the insertion. It will instead demonstrate the brute-force method in detail. Assume you are given the array arr = [1,2, 4, 5, 3] indexed 0...4, Store the value of arr 4]. Now test lower index values successively from 3 to 0 until you reach a value that is lower than arr[4], at arr[1] in this case. Each time your…
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!
Bubble Sort adaptation. Rewrite the following bubblesort algorithm so that in each pass, it “bubbles down” the smallest element to the left end. /*Bubble sort given list into ascending order Input: list a[0...n-1], n: the length of list a Output: list a is rearranged into ascending order BubbleSort (a, n) { //right points to the last element of the "remaining list" //it starts from n-1, after each pass, it decreases by 1 for right=n-1 downto 1: //perform one bubbling pass, bubbling up the largest element to right end for i=0 to right-1: if (a[i]>a[i+1]): swap (a[i], a[i+1]) } Trace the execution of your adapted bubble sort (in Q3) on the following input. Minimally, draw the content of list a after each iteration of the outer-loop. a=[5,3,10,4,2,1] n=6
Implement the following two sorting algorithms in a program called p3.py. Write two separate functions for these algorithms. Both functions must take a list of integers as the input parameter.1) Bogosort: first shuffle the list argument (i.e., randomize the positions of every element) and then check to see if the result is in sorted order. If it is, the algorithm terminates successfully and returns True, but if it is not then the process must be repeated.2) Bozosort: choose two elements in the list at random, swap them, and then check if the result is in sorted order. If it is, the algorithm terminates successfully and returns True, but if it is not then the process must be repeated.Write a main() function and call both sorting functions using the same list as their arguments. The list can be of any size (try a small list first). Does any of your algorithms terminate? If yes, count the number of iterations it uses to sort the list. Does it always use the same number of repetitions? If…
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.