ComputerScienceExpert

(11)

$18/per page/

About ComputerScienceExpert

Levels Tought:
Elementary,Middle School,High School,College,University,PHD

Expertise:
Applied Sciences,Calculus See all
Applied Sciences,Calculus,Chemistry,Computer Science,Environmental science,Information Systems,Science Hide all
Teaching Since: Apr 2017
Last Sign in: 103 Weeks Ago, 3 Days Ago
Questions Answered: 4870
Tutorials Posted: 4863

Education

  • MBA IT, Mater in Science and Technology
    Devry
    Jul-1996 - Jul-2000

Experience

  • Professor
    Devry University
    Mar-2010 - Oct-2016

Category > Programming Posted 19 May 2017 My Price 8.00

benchmarking the behavior of Java implementations

Hey got another question for you. I need help with this assignment. I need to create a program using a sorting method. Attached is the information you'll need. If you could, let me know what sorting method you plan on using before hand. thanks a bunch

 

The first project involves benchmarking the behavior of Java implementations of one of thefollowing sorting algorithms, bubble sort, selection sort, insertion sort, Shell sort, merge sort,quick sort or heap sort. You must post your selection in the "Ask the Professor" conference. Nomore than five students may select any one algorithm.Project 1 involves writing 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 nothave to write them yourself, you may take them from some source, but you must reference yoursource. You must identify some critical operation to count that reflects the overall performanceand modify each version so that it counts that operation. In addition to counting criticaloperations you must measure the actual run time. You are to write code to determine theirefficiency based on the number of times that the critical operation is executed and actual timemeasurements. In addition, you should examine the result of each call to verify that the data hasbeen properly sorted to verify the correctness of the algorithm. If the array is not sorted, anexception should be thrown. It should also randomly generate data to pass to the sortingmethods. It should produce 50 data sets for each value ofn, the size of the data set and averagethe result of those 50 runs. The exact same data must be used for the iterative and the recursivealgorithms. It should also create 10 different sizes of data sets. Choose sizes that will clearlydemonstrate the trend asnbecomes large. You should also calculate the standard deviation of thecritical operation counts and time measurement for the 50 runs of each data set size as a way togauge the data sensitivity of the algorithm. Your program must be written to conform to thefollowing design:Your output should look at follows:DataSetSizenIterativeRecursive

Attachments:

Answers

(11)
Status NEW Posted 19 May 2017 07:05 AM My Price 8.00

-----------

Not Rated(0)