Fundamental Algorithms8 sections · 291 units
Open in CourseQuiz: Boundary Finding
Test your understanding
Check Your Understanding
To find the last occurrence of target in a sorted array, which approach works?
- A.Find upper bound, then return the index before it
- B.Find any occurrence, then linear scan right
- C.Binary search, always move right when equal
- D.Find lower bound, then check the element before