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.