4. If the sequence (15,5,16,2,25,8,20,9,18,12) is known, use merge sort to make it a ascending order set. Please give sorting result of each step.to填写答案0上传附件 n5 A keyword sequence is (72,87,61,23,94,16,5,58), Use heap sort to make it a increased order sequence.Please give the sorting result of each step.

Actually, sorting is a arrange the data elements are in order(ascending/descending)

4 If the sequence (15,5,16,2,25,8,20,9,18,12) is known, use merge sort to make it a ascending order set. Please give sorting result of each step. 填写答案 5 A keyword sequence is (72,87,61,23,94,16,5,58}, Use heap sort to make it a increased order sequence. Please give the sorting result of each step.

4 If the sequence (15,5,16,2,25,8,20,9,18,12) is known, use merge sort to make it a ascending order set. Please give sorting result of each step. 填写答案 5 A keyword sequence is (72,87,61,23,94,16,5,58}, Use heap sort to make it a increased order sequence. Please give the sorting result of each step.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Consider a list L = {387, 690, 234, 435, 567, 123, 441}. Here, the number ofelements n = 7, the number of digits l = 3 and radix r = 10. This means that radixsort would require 10 bins and would complete the sorting in 3 passes. illustrates the passes of radix sort over the list. It is assumed that each key is thrown into the bin face down. At the end of each pass, when the keys are collected from each bin in order, the list of keys in each bin is turned upside down to be appended to the output list
following is the merge function used by MergeSort algorithm. You have the following MergeSort tree that is used to sort the array {19, 4, 13, 9, 2, 7, 11}: The exact number of data comparisons (i.e if (L[i] <= R[j]) ) needed to merge the sorted sublists {4, 9, 13, 19} and {2, 7, 11} are? 5 6 7 8
discrete mathematics (a) Apply the bubble sort to the following list and write the modified list in every cycle [6, 12, 8, 11, 15, 14, 17, 2, 18, 7] (you may stop after it is fully sorted). (b) Merge the following two sets and write the merging list in every iteration [3, 5, 6, 8, 10, 11, 15] and [4, 7, 9, 13, 17]
A keyword sequence is {72,87,61,23,94,16,5,58}, Use heap sort to make it a increased order sequence. Please give the sorting result of each step..
The Quicksort algorithm based on divide and conquer algorithm. Explain the difference between it and merge sort. If the list has the following items17 9 11 30 8 20 35 7 5 45 3 28Apply the quick sort on the above list by using the pivot is always the left item and find the following The list after a first partition call The split point in the second partition call.
Now implement the mergesort function. In the base case (len(lst)<2), return the list itself. Otherwise, split the list into a left half and a right half recursively and use the above merge() function to combine sub-results. Note: Use integer division // when computing the length for each subproblem. from random import randint def mergesort(lst): """Implementation of the MergeSort algorithm. Precondition: lst is a list containing elements that can be compared. :param lst - a list of comparable elements :resut - a list containing all elements in lst in ascending order.""" pass # your code goes here ## wrapper to return a shuffled list, shuffle() updates the input list def shuffled(lst): result = [elem for elem in lst] ## copy lst shuffle(result) return result tests = [ [ [shuffled([n for n in range(20)])], [n for n in range(20)]], [ [[n for n in range(19,-1,1)]], sorted([n for n in range(19,-1,1)])], [ [[]], []],…
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)
1. Explain why the modified bubble sort still exhibits O(n2) behavior on the average. Explain why insertion sort works well on partially sorted lists. 2. Write the use case for returning a book to the library, as discussed in this section. 3. Explain the difference between aggregation and composition; use an example.
The bubble sort algorithm discussed in class is used to sort the following sequence of integers: 2 16 38 9 4 14 How many passes must the algorithm perform to guarantee the entire sequence is sorted? What is the list obtained after the first pass? What is the list obtained after the third pass? What is the list obtained after the final pass?
2. You have a large array that you want to be sorted In ascending order. Under what circumstances would the bubblesort algorithm sort that array very quickly? A. if the array is initially in descending order B. if the array elements can be mapped to a linked list C. if the array elements are already close to their eventual sorted position D. if the array elements are string objects E. never, heapsort will always be faster
1. Implement a generic version of Bubble sort, Selection sort and Quick sort algorithms (use static method). 2. During the implementations count how many comparisons each algorithm required for performing ascending order sorting. Print that count. 3. Test your algorithms by taking two random list: one will take Double type value and other will take String type value (this will verify your generic implementation). Invoke each of the sorting algorithm by passing one list at a time and display both the original list and the sorted list.
The Quicksort algorithm based on divide and conquer algorithm. Explain the difference between it and merge sort. If the list has the following items 17 9 11 30 8 20 35 7 5 45 3 28