Small Project in Java Program.

final_take-home_project.pdf

Home >Computer Science homework help >Small Project in Java Program.

Project: Implement merge-sort and deterministic quick-sort and perform a series of benchmarking tests to see which one is faster. Your tests should include sequences that are “random” as well as sequences that are “almost” sorted. (100 points) Requirements:

• Hard copy of submission is required. • Please attach your Java code for merge-sort, quick-sort, and your benchmarking

tests. • Please also attach your test results. A sample test results table could be something

like this: Random Sequence 1 (What is the sequence to be sorted?)

Almost Sorted Sequence 1 (What is the sequence to be sorted?)

Random Sequence 2 (What is the sequence to be sorted?)

Almost Sorted Sequence 2 (What is the sequence to be sorted?)

Almost Sorted Sequence 3 (What is the sequence to be sorted?)

Merge- Sort

(time to finish)

Quick- Sort

(time to finish)