In the python interview questions course:
page - https://www.educative.io/module/lesson/algorithms-in-python/YVEgVRMVYnY
There are 2 examples to calculate Big O for :
- Nested For-loop with Dependant Variables
- Nested For-loop with Index Modification
In both these examples shouldn’t there be an additional ‘n’ added to the overall calculations? i see that only inner loop operations are being considered when calculating Big O