Week 5 Slog

I have watched a game show these days, the game requires a player to remember the shape of 20 keys and their respective locks, the MC then picks a lock randomly, and the player needs to find the key that will open the lock. I have thought of a way to quickly find the matching key using tracing recursion. We can set the trough as 0 and the crest as 1. Then each key will have a particular set of binary series, which can be transformed into a real number. We can use this number to match the key to its lock. Through this method, we can easily win this game. Therefore, the tracing recursion that we have learned this week is very useful. It can help me win this game if I participate in this show.