Timing Study
Number of Integers 
Bubble Sort Time to Sort 
Insertion Sort Time to Sort 
Selection Sort Time to Sort 
Merge Sort Time to Sort 


















































Analysis
 How do the sorting times for the algorithms compare for a small number of
values?
 How do the sorting times for the algorithms compare for a large number of
values?
 How do the sorting times for the algorithms compare for a very large number of
values?
 What's the largest number of values you can sort using each algorithm in a
reasonable amount of time without running out of memory or stack space?
 When using Bubble Sort to sort n random integers(average case), to what is the running
time proportional (in terms of n)?
 When using Insertion Sort to sort n random integers(average case), to what is the running
time proportional (in terms of n)?
 When using Selection Sort to sort n random integers(average case), to what is the running
time proportional (in terms of n)?
 When using Merge Sort to sort n random integers(average case), to what is the running
time proportional (in terms of n)?