Skip to content

Commit

Permalink
correction in Q1
Browse files Browse the repository at this point in the history
  • Loading branch information
harshitjain17 committed Sep 8, 2022
1 parent 3e21d59 commit 656c0c2
Show file tree
Hide file tree
Showing 2 changed files with 1 addition and 1 deletion.
Binary file modified HW1/hw1.pdf
Binary file not shown.
2 changes: 1 addition & 1 deletion HW1/hw1.tex
Original file line number Diff line number Diff line change
Expand Up @@ -65,7 +65,7 @@
\item $ n^{1.3logn} = \Omega (n^{1.5}) \; ~ \because$ asymptotically $n^{1.3logn} > n^{1.5}$
\item $ 3^{n} = \Omega (n \cdot 2^{n}) \; ~ \because$ asymptotically $3^{n} > n \cdot 2^{n}$
\item $ (logn)^{100} = O (n^{0.1}) \; ~ \because $ power of $ logn$ will only weaken the infinity of $logn$ and $n^{0.1}>(logn)^{100}$
\item $ n = O ((logn)^{log(logn)}) \; ~ \because $ infinity of $(logn)^{log(logn)} > $ infinity of $n$
\item $ n = \Omega ((logn)^{log(logn)}) \; ~ \because $ infinity of $(logn)^{log(logn)} < $ infinity of $n$
\item $ 2^{n} = O (n!) \; ~ \because $ infinity of factorial function is greater than the infinity of exponential function
\item $ log(e^{n}) = O (n \cdot logn) \; ~ \because log(e^{n}) = n $ and we know that $n < nlogn$
\item $ n + logn = \Theta (n + (logn)^2) \; ~ \because $ dominating term is $n$ and powers of $logn$ will not affect infinities
Expand Down

0 comments on commit 656c0c2

Please sign in to comment.