I can’t get help to disambiguate a problem. It involves sorting an array of 11 numbers and filling in a table of values to calculate the state of a branch prediction state machine. The problem is that the table has 16 rows and the input array only has 11 numbers. Do I loop back to the beginning to complete the table? I cannot ever get the answer, and the 2-state machine and MIPS like assembly seem uncomplicated.
The algorithm is if a number is odd take one branch, otherwise take the other branch.
Is there a convention or rule on how to fill out 16 rows of branches with 11 items? I have even tried padding empty spaces with zeros(the input is positive integers).
I also have tried stopping on 11 and writing that state as the answer.
This is the same or very similar machine.
The table has the following columns: input value, Boolean column for even/odd truthiness, branch predicted, branch.