Skip to content

Instantly share code, notes, and snippets.

@choiseoungho

choiseoungho/Big O Time 복잡도

Created January 6, 2019 06:39
Show Gist options
  • Save choiseoungho/0c9339c1d8a962ecc306718c691bc037 to your computer and use it in GitHub Desktop.
Save choiseoungho/0c9339c1d8a962ecc306718c691bc037 to your computer and use it in GitHub Desktop.
Download ZIP
Raw
Big O Time 복잡도
a=5
b=6
c=10
for I in range(n):
for j in range(n):
x= i*I
y= j*j
z= I*j
for k in range(n):
w = a*k +45
v = b*b
d= 33
T(n) = 3+ 3n^2 +2n+1 =3n^2 + 2n +4
Big-O O(n^2)
Referenece
[1] https://wayhome25.github.io/cs/2017/04/20/cs-26-bigO/
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment