Navigation Menu

Skip to content

Instantly share code, notes, and snippets.

@guitarrapc
Last active August 9, 2018 12:10
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save guitarrapc/1cbc89a8e79ffb1f5e6e9ae912c92464 to your computer and use it in GitHub Desktop.
Save guitarrapc/1cbc89a8e79ffb1f5e6e9ae912c92464 to your computer and use it in GitHub Desktop.

Math

オイラーの公式 : $ e^{i\theta}=\cos\theta+i\sin\theta $

計算量 : $ O(1) < O(\log n) < O(n) > O(n \log n) < O(n^2) < O(n^3) < O(n^100) $ \ ------越えられない壁 ------ $ O(2^n), O(n!) $

$$$ O(1) < O(\log n) < O(n) > O(n \log n) < O(n^2) < O(n^3) < O(n^100) $ \\ ------越えられない壁 ------ \\\ $ O(2^n), O(n!) $$$ $$f(x) = ax^2+bx+c$$ $$O(n)$$ $$O(log N)$$ $$\begin{eqnarray} 4a &=& ((a+a)+a)+a \\\ &=& (a+a)+(a+a) \end{eqnarray}$$ $$\log_a \frac{x}{y} = \log_a x - \log_a y \\\ \ln \frac{x}{y}$$ $$O(n \log_n)$$ $$\int f(x)dx \\\ \int_{a}^{b}f(x)dx$$ $$\sum_{k=1}^{n} k = 1 + 2 + 3 + \cdots + n = \frac{n(n+1)}{2}$$ $$\begin{matrix} a & b \\\ c & d \end{matrix}$$ $$\begin{pmatrix} a & b \\\ c & d \end{pmatrix}$$
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment