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

Exercises

The following exercises provide you with the opportunity to practice analyzing algorithms. The solutions to these exercises are found in the section ​Chapter 5​.

1. Use Big O notation to describe the time complexity of an algorithm that takes 4N + 16 steps.

2. Use Big O notation to describe the time complexity of an algorithm that takes 2N².

3. Use Big O notation to describe the time complexity of the following function, which returns the sum of all numbers of an array after the numbers have been doubled:

   function doubleThenSum(array) {
     const doubledArray = [];
   
     for (const number of array) {
       doubledArray.push(number * 2);
     }
   
     let sum = 0;
   
     for (const number of doubledArray) {
       sum += number;
     }
   
     return ...