Unformatted text preview: COP 3503H – Spring 2001– Programming Assignment #2 Due Date: March 27, 2001 at class time. Points: 100 total – program 60 points, writeup 40 points Objective: You will implement the Insertion sort, the Shell sort, and the Quick sort algorithms (all of which appear in the class notes) and produce a timing analysis for all three algorithms using input arrays of various size N which will be produced both as random permutations of the first N integer numbers as well as fixed permutations. This programming assignment will reinforce various techniques discussed thus far in class involving algorithm analysis, sorting techniques, and randomization. Technique: You will need to generate 3 random permutations of the first N integers for values of N equal to 100, 500, and 1000 (an algorithm to do this appears on page 268 in your textbook) as well as fixed permutations 1..N and N..1 when N = 500. Thus your five arrays are: Array 1: random permutation of first 100 integers. Array 2: random permutation of first 500 integers. permutation of first 500 integers....
View
Full Document
 Spring '08
 Staff
 Computer Science, Algorithms, Insertion Sort, Quick Sort, web site, hard copy, Random permutation, Quick sort Algorithms

Click to edit the document details