$\require{cancel}$

A Third Algorithm

Let's work on the third example problem
Remember we need to:
- Read and understand the problem.
  - Note ambiguities/inconsistencies/problems
- Provide a high level summary.
- Note input/output
- Develop a method
  - Note potential test cases while doing this
- Write an algorithm
- Test the algorithm.
Any questions?
- How many different types of ice cream do we have? Don't worry about that, just ask for a flavor until NONE is entered
- Do we have a different average number of cones for each flavor? Yes.

A high level summary:

 For each flavor of ice cream cone sold, 
      given the number of ice cream cones of that flavor we expect to sell 
      and the type of day, compute the number of gallons of each flavor 
      of ice cream needed if one gallon of ice cream will make 24 cones.

Input/output
- Input: type type of day, flavors, number of cones for that flavor
- Output: gallons of ice cream for each flavor.

Examples:

Day Type: normal
   multiplier = 1
Flavors: chocolate, vanilla, peach
Cones:    50, 20, 259
    chocolate: 3 gallons x multiplier = 3
    vanilla: 1 gallon x multiplier = 1
    peach 11 gallons x multiplier = 11

Day Type: busy
   multiplier = 2
Flavors: chocolate, vanilla, peach
Cones:    50, 20, 259
    chocolate: 3 gallons x multiplier = 6
    vanilla: 1 gallon x multiplier = 2
    peach 11 gallons x multiplier = 22

Algorithm

ask the user for type of day (normal, busy, holiday)

if typeOfDay == normal
   multiplier = 1
else if typeOfDay == busy
   multiplier = 2
else  if typeOfDay == holiday
   multiplier = 4
else 
    multiplier = 1
    print error

ask the user for the flavor
while the user does not enter NONE
    ask the user for the number of cones
    baseGallons = roundup(cones/CONES_PER_GALLON)
    gallons = baseGallons * multiplier
    print the number of gallons needed for that flavor 

    ask the user for the flavor

If you would like a java solution is here