Cody

# Problem 2635. Higher! Lower!

Solution 2047614

Submitted on 5 Dec 2019 by Tom Holz
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

### Test Suite

Test Status Code Input and Output
1   Pass
hi_bound=1024; lo_bound=1; right_answer=512; assert(isequal(high_or_low(lo_bound,hi_bound,right_answer), 512))

2   Pass
hi_bound=1024; lo_bound=1; right_answer=513; assert(isequal(high_or_low(lo_bound,hi_bound,right_answer), [512 768 640 576 544 528 520 516 514 513]))

3   Pass
hi_bound=0; lo_bound=-16; right_answer=-3; assert(isequal(high_or_low(lo_bound,hi_bound,right_answer), [ -8 -4 -2 -3]))

4   Pass
hi_bound=1024; lo_bound=1; right_answer=1024; assert(isequal(high_or_low(lo_bound,hi_bound,right_answer), [512 768 896 960 992 1008 1016 1020 1022 1023 1024]))

5   Pass
hi_bound=2048; lo_bound=0; right_answer=0; assert(isequal(high_or_low(lo_bound,hi_bound,right_answer), [1024 512 256 128 64 32 16 8 4 2 1 0]))

6   Pass
hi_bound=65535; lo_bound=0; right_answer=1024; assert(isequal(high_or_low(lo_bound,hi_bound,right_answer), [32767 16383 8191 4095 2047 1023 1535 1279 1151 1087 1055 1039 1031 1027 1025 1024]))

7   Pass
hi_bound=1; lo_bound=0; right_answer=1; assert(isequal(high_or_low(lo_bound,hi_bound,right_answer), [0 1]))