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

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

View Full Document Right Arrow Icon
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.
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 04/04/2011 for the course CS 2400 taught by Professor Richie during the Spring '11 term at Rensselaer Polytechnic Institute.

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 Right Arrow Icon
Ask a homework question - tutors are online