This preview shows page 1. Sign up to view the full content.
Unformatted text preview: You see, I didnt use the computer clock. I used my own office clock and the ol 1-Mississippi, 2-Mississippi method. The results werent precise, but they did tend to support that the program runs in (n) time. 50 time (seconds) inputs (number of integers) Program 2 Run Times Time 9 19 30 41 49 10000 20000 30000 40000 50000 As the chart above indicates, the time to run Program 2 was roughly proportional to the number of inputs. It was almost exactly a linear relationship between inputs and run time....
View Full Document
This note was uploaded on 01/19/2010 for the course CSC 375 taught by Professor Turner during the Spring '09 term at University of Michigan-Dearborn.
- Spring '09
- Data Structures