i need to write a program wich does :

array : 1 2 3 4 5 6 7 8 9
A=2
B=4
numbers between A-B is 1

and this program must use binary research(and must be recursive)

If you can supply the entire code i will be pleased :D if not link some pages or post here some example code(binary search, recursive programs in assembly)

1) We don't do homework for you.
2) Your explanation isn't clear enough.
Hint:

nCount = | A - B | - 1             # Exclusive indexes
nCount = | A - B | + 1             # Inclusive indexes