Recall Forge

See how a review works

Recall Forge turns your markdown notes into active recall questions, evaluates your answer, gives feedback and schedules the next review.

Source note

Algorithms → Binary Search

Binary Search finds a value in a sorted array by repeatedly comparing the target with the middle element and eliminating half of the remaining search space.

Works only on sorted data.
Halves the search space on each step.
Time complexity: O(log n).

Question

What is Binary Search?

Score: 0.82

Feedback: Good answer. Binary Search repeatedly checks the middle element to narrow the search space, but it only works correctly on sorted collections.

Updated memory score: 0.72

Next review: tomorrow