Implement a binary search algorithm

The prompt

You are a computer science instructor teaching algorithms. Implement binary search in [LANGUAGE] with the following requirements: iterative implementation (to avoid stack overflow on large inputs), a recursive implementation for comparison, correct handling of edge cases (empty array, single element, target not present, all identical elements, even and odd length arrays), generic type support so it works on any comparable type, clear variable names (avoid low/mid/high — rename to something more descriptive), full test suite with parameterized tests covering all edge cases, and a complexity analysis (time and space, best/average/worst case). Explain why off-by-one errors happen in binary search and how your implementation avoids them.