As the diameter of each tyre is written on the sidewall (which faces upwards in the stack
Question:
As the diameter of each tyre is written on the sidewall (which faces upwards in the stack of tyres), the only way for Jo to find if a particular diameter tyre is in a given stack of tyres is to take off the tyre above it, and then inspect the resulting new top tyre. This process is repeated until the tyre needed is found in the given stack, a tyre larger than the one being looked for is found, or the stack is empty. Jo has to rebuild the stack afterwards. As Jo's tyre shop is very tightly packed, there is not much room to move tyres around. Jo leaves two empty stack spaces, MOVEA and MOVEB, which can be used to build temporary stacks of tyres while a particular stack is being searched. Note that Jo is not removing the tyre.
Write an operation to implement the definition below to find whether a tyre of tyre diameter is within stack name within tyre shop. You should make use of a recursive technique and may create additional functions or operations if you wish.
Operation: tyre in stack
Inputs/Outputs: tyre shop, a TyreShop
Inputs: tyre diameter, an integer, stack name, a string
Preconditions: stack name exists within tyre shop, MOVEA and MOVEB exist within tyre shop and are empty stacks.
Output: found a Boolean
Postconditions: tyre found is true if tyre diameter is found within stack name, else false; MOVEA and MOVEB are empty; stack stack name has the same contents and order as it did prior to operation call.
You can use the tests below to help check if your code is working.
NOTE that failing the tests is a clear indication your code is faulty, but passing the tests is NOT a guarantee it is correct.
Your tutor may run additional tests.
Note
This is a challenging question designed to encourage you to explore recursive solutions to problems. While you are encouraged to tackle the problem recursively, some marks are available if you complete the question in a non-recursive manner. You might like to research the "Towers of Hanoi" when tackling this question.
#answer here
#Tests
tyreshop.show()
test_table = [
['Exists at top',tyreshop,190,'A',True],
['Exists in middle',tyreshop,200,'A',True],
['Does not exist',tyreshop,7,'A',False],
]
test(tyre_in_stack, test_table) #Ensure the function name in this line matches your function.
tyreshop.show()
Expert Answer:
To implement the requested operation for finding whether a tyre of a specific diameter is within a given stack in a tyre shop using recursion we follo... View the full answer
