Name That Sort Summary - TEAM MEMBERS: ALEX PACKARD AND BEN...

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

View Full Document Right Arrow Icon
TEAM MEMBERS: ALEX PACKARD AND BEN SMITH BRIEF DESCRIPTION OF PROCESS All the various sorts were given an input of an array filled with randomly generated integers. The sizes of these arrays varied from 10 integers to 200000 integers. The printouts from running the program were stored in a separate document for later analysis. Comparing the run times of the various sorts against an online list of average and worst runtimes 1 to separate them into groups based on runtime. These groups could be used to narrow the list of possible sort types and make the second step easier. The results of this first test run are as follows: A few special cases were found; Sort 2 was non-comparison, sort 3 had trouble running any size array greater than 10, and sort 4 had trouble processing after an array of size 4. Runtimes were determined by dividing the time it took the array of size 2n (where n=10, 1000, 10000, or 100000) to process by the time the array of size n took. Sorts having an approximate Big-Oh time of n2 were 0, 6, and 7. Sorts 2 and 5 had runtimes of n log n. Sort 3, with its incredible slowness, was assumed to be MysterySort1, hinted at in the project directions as being the slowest sort. With this initial sort complete, another set of arrays was run through the program, but this group was of numbers in the correct order rather than randomly generated integers. The purpose of this second run was to partition the sorts even further, and hopefully to be able to pick out which sort was which. The results of this second sort follow: 1 http://en.wikipedia.org/wiki/Sorting_algorithm
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/08/2008 for the course HIST 101 taught by Professor Wormer during the Spring '08 term at Rensselaer Polytechnic Institute.

Page1 / 4

Name That Sort Summary - TEAM MEMBERS: ALEX PACKARD AND BEN...

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