How does this built-in search method compare to linear search?
const index = [1, 3, 5, 7, 9].findIndex(x => x >= 6);
findIndex implements linear search because: 1) Examines elements sequentially, 2) Time complexity is O(n), 3) Stops at first matching element, 4) No array ordering requirement, 5) Can use complex predicates, 6) Returns -1 if not found, 7) Part of JavaScript array prototype, 8) Convenient for simple searches with predicates.