These test cases were chosen to exemplify and debug for all possible implementations of the algorigthm. That is, the multiplicand ('A' in the algorithm), was chosen such that all possible factors of the multiplier (0,1,2,3,4,-4,-3,-2,-1) were used. As such, only three values of 'A' were required since each multiplication takes three iterations. Additional test cases were chosen to exemplify negative, positive, 0, maximum, and minimum values of the multiplier ('B').