Based on the book Crafting Interpreters and this repo
``` fun binary_search(list, item) { var low = 0; var high = list.len() - 1;
while low <= high { var mid = (low + high) / 2; var guess = list[mid]; printf("low: {}, high: {}, mid: {}, guess: {}", low, high, mid, guess);
if guess == item {
return mid;
} else if guess > item {
high = mid - 1;
} else {
low = mid + 1;
}
} return nil; }
var elements = [1, 3, 5, 7, 9]; var search = 7; printf("element {} is at index: {}", search, binary_search([1, 3, 5, 7, 9], 7)); ```
c.l[0] = 1;
)[+-*/]=
, i++
and i--