Linear Search Algorithm | JavaScript

const numbers = [2, 4, 67, 8, 44, 6, 12];

function linearSearch(array, num) {  for (let i = 0; i < array.length; i++) {    if (array[i] === num) {      return i;    }  }  return -1;}linearSearch(numbers, 8); // returns index 4linearSearch(numbers, 28); // since 28 is not there, returns -1 // Save the file and run it using Node.JS// Open terminal and give command: node [filename].js

function betterLinearSearch(array, element) {  let length = array.length;  let left = 0;  let right = length - 1;  let position = -1;  while (left <= right) {    if (array[left] == element) {      position = left;      console.log(`${element} is present at index ${position}. attempt ${left + 1}`);      break;    }    if (array[right] == element) {      position = right;      console.log(`${element} is present at index ${position}. - attempt ${length - right}`);      break;    }    left++;    right--;  }  if (position == -1) {    console.log(`${element} not found. attempt ${left}`);  }}betterLinearSearch(numbers, 8); // Try with a last element and check the attempts in logbetterLinearSearch(numbers, 12); betterLinearSearch(numbers, 28);// Save the file and run it using Node.JS// Open terminal and give command: node [filename].js