https://rohanroy8.github.io/A personal blog where I post about my philosophical musings and my learnings related to computer science field such as DSA, web development. 2026-06-10T17:41:18+00:00 Rohan Roy https://rohanroy8.github.io/ Jekyll © 2026 Rohan Roy /assets/img/favicons/favicon.ico /assets/img/favicons/favicon-96x96.png 2025-12-07T00:00:00+00:00 2025-12-10T18:36:52+00:00 https://rohanroy8.github.io/posts/Asymptotic-Notation/ Rohan Roy

Notes: Big O: Gives the tight upper bound of the given function O(g(n)) = f(n) eg:- f(n) = n⁴ + 100n² + 10n + 50 g(n) = n⁴, is the upper bound g(n) gives the maximum rate of growth for f(n) Guidelines for analysis: Loops: for(i=0; i<=n; i++) //executes n times m=m+2 //constant time total time = c*n = cn = O(n) Nested loop: ...