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

  1. How do the sorting times for the algorithms compare for a small number of values?
    
    
    
    
  2. How do the sorting times for the algorithms compare for a large number of values?
    
    
    
    
  3. How do the sorting times for the algorithms compare for a very large number of values?
    
    
    
    
  4. 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?
    
    
    
    
    
    
    
    
    
    
  5. When using Bubble Sort to sort n random integers(average case), to what is the running time proportional (in terms of n)?
    
    
    
    
    
  6. When using Insertion Sort to sort n random integers(average case), to what is the running time proportional (in terms of n)?
    
    
    
    
    
  7. When using Selection Sort to sort n random integers(average case), to what is the running time proportional (in terms of n)?
    
    
    
    
    
  8. When using Merge Sort to sort n random integers(average case), to what is the running time proportional (in terms of n)?