Micronaut here (Microverse Student) To get the complexity of this algorithm is actually quite simple, just check if there is an existing nested for loops and if those for loops actually depend on the input. For example: for(... input.length) { for(...input2.length) { } } this code's complexity will be the length of input1 * length of input2. and if they are the same, it will be the length^2. which is what we note by n².