CS420 Discussion Two
                       ====================

    Check the RamCT calendar for due dates for the discussion.

   i. Define the following concepts and discuss their use.

      - Basic measures for the time and space requirements of an algorithm:
          big O, big Omega, big Theta
      - Worst/average case complexity of an algorithm
      - Upper/lower bound of a problem
      - Algorithmic gaps vs. closed problems

   ii. Given a sorted sequence of positive integers, add these such that the 
       smallest numbers, including intermediate results, are added together.

       Example 

          sequence     1 2 2 2 5 6
          additions:   1+2
                       2+2
                       3+4
                       5+6
                       7+11

       a) What is the lower bound of this problem? 
       b) Is this a closed problem? Discuss