Answered step by step
Verified Expert Solution
Question
1 Approved Answer
Please follow the instructions given below to implement the merge-sort algorithm to sort an array in Java. Collect the edition time and graph/plot the function
Please follow the instructions given below to implement the merge-sort algorithm to sort an array in Java. Collect the edition time and graph/plot the function using any plotting software. The program to implement is also given below. Thanks Objectives of this assignment . to explore time complexity and "real time What you need to do: I. Implement the Merge-Sort algorithm to sort an array. (See Appendix for the Merge-Sort algoritchm) 2. Collect the execution time T(n) as a function of n 3. Graph/plot the function T(n).log:(n). 4. In Module 4 (next module), we will establish that the running tineT(n) of eres tis nlegin). Discuss T(n) in light of the graph you plotted above. Objective: The objective of this programming assignment is to design and implement in Java the Merge-Sort algorithm presented in the lecture to sort a list of numbers. We are interested in exploring the relationship between the time complexity and the "real time". For this exploration, you will collect the execution time T(n) as a function of n and plot T(nynlog:(n). Finally, discuss your results Program to implement collectData () Generate an array G of HUGE length L (as huge as your language allows) with random values capped at oxfffffffe. for n-10 to L (with step 1,000) copy in Array A n first values from Array G Start timing / We time the sorting of Array A of length n Merge-sort (A, 0,n-1) Store the value n and the value T (n).log: (n) in a file F where T(n) is the execution time Data Analysis Use any plotting software (eg. Excel) to plot the values T(nyn log (o) in File F as a function of n. File F is the file produced by the program you implemented. Discuss your results based on the plot Report Write a report that will contain, explain, and discuss the plot. The report should not exceed one page. In addition, your report must contain the following information whecher the program works or not (this must be just ONE sentence) o o the directions to compile and execute your program Good writing is expected. Recall that answers must be well written, documented, justified, and presented to get full credit. What you need to turn in: Electronic copy of your source program . Electronic copy of the report (including your answers) (standalone). Submit the file as a Microsoft Word or PD file. rading Program is worth 30% if it works and provides data to analyze Quality of the report is worth 70% distributed as follows: good plot (25%), explanations of plot (10%), and conclusion (35%)
Please follow the instructions given below to implement the merge-sort algorithm to sort an array in Java.
Collect the edition time and graph/plot the function using any plotting software.
The program to implement is also given below.
Thanks
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started