| about | help | code help+videos | done | prefs | 
| Given an integer arraylist and a target value, use the binary search algorithm to return the index where that value appears in the data set. Return -1 if the value does not exist. Note: The integer arraylist is already sorted from least to greatest and you must use binary search to receive credit for this problem. binarySearch_list([1, 3, 5], 1) → 0 binarySearch_list([1, 3, 5], 3) → 1 binarySearch_list([1, 3, 5], 5) → 2 ...Save, Compile, Run (ctrl-enter) | 
Progress graphs: 
 Your progress graph for this problem
 Random user progress graph for this problem 
 Random Epic Progress Graph
Copyright Nick Parlante 2017 - privacy