Question: I have a Marie code that reads ASCII codes and translates them into decimal numbers, and reads their binary numbers. With my code, i am
I have a Marie code that reads ASCII codes and translates them into decimal numbers, and reads their binary numbers. With my code, i am to check its effiency with IO Testing. However my code (which is a parity checker), checks each character individually which effects the effiency. I was told to create a binary search which speeds the process of checking faste, yet i have no idea how to implement this. If you can provide a example of how to implement a binary search tree that has two levels within a Marie Simulator i would apprieciate that.
also if you need additional attachments let me know. Thanks
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
