Practice · 2 of 3
Binary Search
CHALLENGE
Difficulty: beginner+25 XP
Implement int binary_search_cj(const int *a, int n, int t) on an ASCENDING-sorted array: return any index of t, or -1. Use the halving loop.
Press Submit to check your solution.
Back to lesson: Practice: Search Practice