Practice · 3 of 4
Linear Search
CHALLENGE
Difficulty: beginner+25 XP
Implement int find(const int* a, int n, int target) returning the FIRST index holding target, or -1 if absent.
Press Submit to check your solution.
Back to lesson: Practice: Array Workbench