Linear Search
Linear search checks elements one by one until it finds the target or reaches the end.
ابدأ بهذا النموذج الذهني
Linear search checks elements one by one until it finds the target or reaches the end.
كيف يعمل، بلا مصطلحات زائدة
It needs no sorting or preprocessing.
Worst-case it examines every element, so time is O(n).
اقرأ الخوارزمية كسلسلة من القرارات
Write the preconditions first (sorted? uniform? random access?).
Maintain a clear search interval/state.
Prove that each step makes progress toward termination.
Read a tiny input by hand and write down the state after every important operation. For Linear Search, the goal is to make the invariant visible rather than to memorize code.
function linearSearch(items, target) {
for (let i = 0; i < items.length; i++) {
if (items[i] === target) return i;
}
return -1;
}لا تحفظ الصياغة. تتبع الحالة التي تتغير في كل سطر واربطها بالثابت الموضح أعلاه.
O(n)
Do not quote this complexity mechanically. Ask which operation or input dimension it describes, then derive the cost from the loops, recursion depth, data-structure operations and any preprocessing assumptions.
مناسب لـ
- Match the algorithm to the structure and preprocessing state of the data.
ما الذي يسوء عادةً
- Violating preconditions.
- Boundary and termination bugs.
صيغة إجابة احترافية
Do not dismiss it as 'bad'. For small, unsorted or one-off searches it may be the simplest and correct choice.
What problem does Linear Search solve?
Linear search checks elements one by one until it finds the target or reaches the end.
ماذا يجب أن أذكر عن التعقيد؟
Its typical cost here is O(n), but a complete answer should connect that cost to the representation, input constraints and the dominant operations.
ما الخطأ الأكثر شيوعاً؟
Violating preconditions.