{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

# prog2 - COP 3503H Programming Assignment#2 Fall 2002 Title...

This preview shows pages 1–2. Sign up to view the full content.

Title: “Program Assignment 2: Analyzing Sorting Algorithm Performance” Points: 100 points – 60pts for coded portion, 40 points for written analysis Due Date: Wednesday October 23, 2002 Objectives: (1) To reinforce the concepts underlying the asymptotic behavior of several sorting algorithms. (2) Further develop Java programming skills. Description: Create a Java program that produces the necessary data to analyze the asymptotic behavior of three sorting algorithms. Do this according to the steps shown below: 1. You will need to generate 3 random permutations of the first N integers for values of N equal to 100, 500, 1000, 5000, and 10,000 (you may need to adjust the sizes of N) as well as fixed permutations 1..N and N..1 when N = 500. Thus for each value of N you will have five arrays: 3 permuted and 2 fixed sequences. 2. Once the arrays are generated use a copy of each of them as input to the following sorting algorithms: (a) insertion sort, (b) selection sort, and (c) Shell sort with the initial gap and a decrement of N/2.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}