return false;
};
const nums = [1, 2, 3, 4, 5, 5];
hasDuplicates(nums); //true

Iterating an array is O(N). But we have a nested loop, iterating again for each element – i.e., O(N^2) or "complexity of order n square."

Algorithms with nested loops over the same collection are always O(N^2).

O(2^N)

O(2^N) denotes an algorithm whose growth doubles with each addition to the input data set. The growth curve of an O(2^N) function is exponential - starting off shallow and then steeply rising. An example of an O(2^N) function is the recursive calculation of Fibonacci numbers:

<< Prev | 7/11 | Next >>
English
Home