Skip to main content
Sagnik's user avatar
Sagnik's user avatar
Sagnik's user avatar
Sagnik
  • Member for 9 years, 5 months
  • Last seen this week
Loading…
answered
Loading…
revised
Chomsky Classification of Languages
Improved the formatting
Loading…
suggested
Approve
awarded
comment
Why $2R\sigma\sqrt{T+logT+1}=\tilde{{O}}(\sigma\sqrt{T})$?
$\textbf{Wikipedia entry:}$ This notation is often used to obviate the "nitpicking" within growth-rates that are stated as too tightly bounded for the matters at hand (since $n\log k$ is always $o(n\epsilon)$ for any constant k and any $\epsilon > 0$).
revised
Loading…
Loading…
Loading…
Loading…
answered
Loading…
comment
Minimum number of comparisons to sort k elements among n
It might be a fun exercise if you try to write a program to compute that table.
Loading…
revised
Loading…
1
2
3 4 5
10