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

Actually, java is an object oriented programming language. It is a platform independent.

Answered: 1. Implement external sort: for sort…

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

Related questions

Question

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

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 3 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions