comp129-spr19 / Diner-Hash---Educational-Python-Game

Diner Hash | An Educational Computer Science game to teach Hash Tables
1 stars 1 forks source link

Dynamically add the requests to a fixed array (max size of, say, 5) every fixed amount of time #54

Open mfraser4 opened 5 years ago

jilliebean commented 5 years ago

Complexity Jillian: 1

brforest commented 5 years ago

Complexity Beau: 2 This implies that we also need to deduct points/lives if the max number is exceeded, correct?

brforest commented 5 years ago

We had a bit of a workaround here, by initializing 15 (arbitrary number) tickets to the window. Given the amount of time I would expect the user to play the game, and the limited number of counters, I would imagine this is sufficient. If not, we can always add more very easily (just increase the range of the for loop that creates the tickets). Once the ticket window runs out, it will just display a message to the user that there are no more tickets.