For this assignment you will design an experiment to compare the Selection, Insert, and Bubble Sort

Algorithms.

For this assignment you will come up with a collection of questions that pertain to comparing

algorithms.

$($i$.$e$.$ How do they compare with small groups of data, large groups of data, semi$-$sorted data $,$ data in

a small range, data in a large range, etc$).$

After that I want you to design, code, and run the experiment.

Lastly I want a writeup explaining what you did, your results $($what the experiment yielded$),$ and

your conslusions $($how you interpret them$).$

With this assignment I want to see commented code.

The writeup can be submitted as a word doc or a powerpoint. You can be brief with this.

IF I have more questions I will let you know.

While it can be done as either a paper or a slide show I should be able to read through it$.$ The

following questions need to be addressed:

What questions were you looking at$?$

How you decided to look at them?

What did you do$?$

What were the results?

What are your conclusions Hypothesis:

I hypothesize that the Large Data set will be slowest in all cases and the small data set will be the fastest in all cases, with the insert sort being the fastest of all sorts.

Procedure:

The data sets all have a control size and range of $500$ so that the size and range can be tested independently of one another. I ran the sorts $999$ times because the amount of time it take for each sort is so small that it was showing $0-1$ milliseconds for all sorts and all data sets when the sort was run less times.

Randomly generate four different one$-$dimensional arrays.

Large range: $0-1000$

Small Range: $0-250$

Standard Range: $0-500$

Large Set: $1000$

Small Set: $250$

Standard Set: $500$ in a $0-500$ range

Test each type of sorting algorithm on each set $999$ times.

Bubble Sort

Insert Sort

Selection Sort

Output the time duration of each sort. Discussion:

Analysis:

Conclusion: use java for this