Exam-Ready Answers and Detailed
Explanations | Latest 2026/2027
Edition
An algorithm needs to have exact definitions
1 Definiteness
for each step
Robustness refers to an algorithm's ability to
2 robustness
define your problem clearly.
3 functionality logical steps to solve a real-world problem.
4 linear search best case O(1) — The target element is the first element.
O(n) — The target element is somewhere in
5 average case
the middle or not in the array.