{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

# hw4 - CSCI-1100 Computer Science I Rensselaer Polytechnic...

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

CSCI-1100 Computer Science I Rensselaer Polytechnic Institute Fall, 2009 HW 4 For this assignment, you will implement two sorting algorithms using two data structures and time them for inputs of various sizes. Do the following: Write functions that implement quick sort and merge sort once using arrays and once using vectors. Each should take as its argument, either a one dimensional array of integers with a size value, or a vector of integers Write a main that: – confirms that each of your sorting algorithms works properly for both data structures by generating an array of 20 integers, displaying the unsorted data on a single line , sorting the data, and displaying the sorted values on a single line . You will need a total of 4 tests. – generate arrays of random integers of size 32000, 64000, and 128000. – time how long it takes to perform each sort. There should be 12 separate timings.

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 ]}

### Page1 / 2

hw4 - CSCI-1100 Computer Science I Rensselaer Polytechnic...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online