Algorithm vs Language
Searching for an element in a sorted array
Iterative Search
function linearSearch(arr, target) {
for (let i=0; i<arr.length; ++i) {
if (arr[i]===target) {
return arr[i];
}
}
}Binary Search
function binarySearchIterative(arr, target) {
let left = 0;
let right = arr.length-1;
while (left<=right) {
let mid = left + Math.floor((right-left)/2);
if (arr[mid]===target) {
return target;
}
if (target>arr[mid]) {
left = mid+1;
}
else {
right = mid-1;
}
}
return -1;
}
Sum From 1 to N
Iterative Search
Single calculation/instruction
Insert/Delete Item in an Array

Last updated
Was this helpful?