# time complexity
https://adrianmejia.com/how-to-find-time-complexity-of-an-algorithm-code-big-o-notation/#:~:text=For%20any%20loop%2C%20we%20find,program%20will%20repeat%20the%20loop.&text=All%20loops%20that%20grow%20proportionally,that's%20still%20O(n)%20.