Linear Search
O(N)
N = 20
Adım: 0 / 20
for (i = 0; i < N; i++)
if (arr[i] == target)
return index; // Bulundu
return -1; // Bulunamadı
i-
arr[i]-
Target-
Binary Search
O(log N)
log₂20 ≈ 5
Adım: 0 / 5
while (low <= high)
mid = floor((low + high)/2)
if (arr[mid] == target) return
if (arr[mid] < target) low=m+1
else high=m-1
Low-
High-
Mid-
arr[M]-