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

Using Java, 1. Implement external sort: for sort phase use normal sort, for merge phase use two way merge to merge n sorted files (merge2way(n)), for array sort use heapsort. Also write merge(f1, f2, f3) to merge two sorted files f1 and f2 into f3.. Write mergenway(n) method and print execution time of both merges for initial input file over 10MB data. A sample input is as follow:Note:Fist input is max array size for sort 10 84 82 52 80 96 85 75 75 82 87 92 89 57 94 93 92 63 99 87 72 73 56 74 50 84 62 72 55 86 75 74 100 83 60 53 68 89 67 66 65 72 94 73 54 98 96 85 75 75 82 87 92 89
Please justify your answer: Some sorting algorithms require extra space, apart from the space needed for the original array that needs to be sorted. Which one of the following statements on the space usage of sorting algorithms is correct? a.) A Heapsort for sorting an array of size N requires an amount of extra space proportional to N. b.) Insertion Sort for sorting an array of size N requires an amount of extra space proportional to N. c.) Merge sort for sorting an array of size N requires an amount of extra space proportional to N. d.) Quicksort for sorting an array of size N requires an amount of extra space proportional to N. e.) None of the above
t/f
All parts of Q11 please.
Computer Science Questions