Finding the largest and smallest number in an unsorted array of integers in JavaScript

We are required to write a JavaScript function that takes in an array of Numbers. The function should, in linear time and constant space, find the largest and smallest numbers that exist in the array. The function should return an object that contains the min and max numbers.

Example

Following is the code −

const arr = [112, 24, 31, 44, 101, 203, 33, 56];
const findMaxMin = (arr) => {
   let max = arr[0];
   let min = arr[0];
   for(let i = 0; i < arr.length; i++) {
      if(arr[i] > max) {
         max = arr[i];
      }
      else if (arr[i] < min) {
         min = arr[i];
      }
   };
   return {
      min, max
   };
};
console.log(findMaxMin(arr));

Output

Following is the output on console −

{ min: 24, max: 203 }