A Common-Sense Guide to Data Structures and Algorithms in JavaScript, Volume 1

Exercises

The following exercises provide you with the opportunity to practice with Big O notation. The solutions to these exercises are found in the section ​Chapter 3​.

1. Use Big O notation to describe the time complexity of the following function that determines whether a given year is a leap year:

   function isLeapYear(year) {
     if (year % 100 === 0) {
       if (year % 400 === 0) {
         return true;
       } else {
         return false;
       }
     }
     return year % 4 === 0;
   }

2. Use Big O notation to describe the time complexity of the following function that sums up all the numbers from a given array:

   function arraySum(array) {
     let sum = 0;
   
     for (const number of array) {
       sum += number;
     };
   
     return sum;
   }

3. The following function ...