Subject Computer Science Java Programming

Question

The first project involves benchmarking the behavior of Java implementations of one of the following sorting algorithms, bubble sort, selection sort, insertion sort, Shell sort, merge sort, quick sort or heap sort.
You must write the code to perform the benchmarking of the algorithm you selected. Your program must include both an iterative and recursive version of the algorithm. You do not have to write the sorting algorithms yourself, you may take them from some source, but you must reference your source.
You must identify some critical operation to count that reflects the overall performance and modify each version so that it counts that operation. In addition to counting critical operations you must measure the actual run time.
In addition, you should examine the result of each call to verify that the data has been properly sorted to verify the correctness of the algorithm. If the array is not sorted, an exception should be thrown.
It should also randomly generate data to pass to the sorting methods. It should produce 50 data sets for each value ofn, the size of the data set and average the result of those 50 runs. The exact same data must be used for the iterative and the recursive algorithms. It should also create 10 different sizes of data sets. Choose sizes that will clearly demonstrate the trend as n becomes large.
You should also calculate the coefficient of variance of the critical operation counts and time measurement for the 50 runs of each data set size as a way to gauge the data sensitivity of the algorithm.

Solution Preview

This material may consist of step-by-step explanations on how to solve a problem or examples of proper writing, including the use of citations, references, bibliographies, and formatting. This material is made available for the sole purpose of studying and learning - misuse is strictly forbidden.

import java.util.Stack;

public class YourSort implements SortInterface {

    private int count;
    private long time;

    /**
    * constructor
    */
    public YourSort() {
    }

    /**
    * reset all before sorting
    */
    private void reset() {
       count = 0;
       time = 0;
    }...

This is only a preview of the solution. Please use the purchase button to see the entire solution

Assisting Tutor

Related Homework Solutions

Accounting Problems in Java
Homework Solution
$20.00
Computer Science
Java Programming
Accounting
Classes
Interest Rates
Funds
Withdrawals
Savings
Data Fields
Initial Balance
Constructors
Java Programming Problems
Homework Solution
$4.00
Computer Science
Java Programming
Strings
People
Objects
Differences
References
Classes
Variables
Printing
Constructors
Java Programming Problems With Sockets
Homework Solution
$60.00
Computer Science
Java Programming Sockets
Applications
Connections
Hiking Company
Servers
GUI
Clients
Costs
Java Programming Problems
Homework Solution
$8.00
Computer Science
Java Programming
Annual Compensation
Sales
Fixed Salary
Percentage
Earnings
Calculated Values
Looping Structures
Source Codes
Summary Statistics of Tasks
Homework Solution
$64.00
Computer Science
Java Programming
Summary Statistics
Average Time
Data
Commands
Log Entries
Classes
Java Programming Exercises
Homework Solution
$20.00
Computer Science
Java Programming
Classes
Inheritance
Vehicles
Bicycles
Cars
Attributes
Objects
Arrays
Parameters
Constructors
Get help from a qualified tutor
Live Chats