barrett/barrettruth.com
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

fix(post): user proper asymptotic notation syntax

Browse source
This commit is contained in:
Barrett Ruth 2024-11-12 12:06:40 -05:00
parent 7802876632
commit 2aa27c86b7
1 changed files with 4 additions and 4 deletions
Download patch file Download diff file Expand all files Collapse all files

8
posts/algorithms/leetcode-daily.html
View file

@ -158,12 +158,12 @@
runtime in terms of \(max\{n,m\}\). runtime in terms of \(max\{n,m\}\).
</p> </p>
<p> <p>
<u>Time Complexity</u>: \(O(nlg(n)+mlg(m)+m)=O(nlg(n)+mlg(m))\). <u>Time Complexity</u>: \(O(nlg(n)+mlg(m)+m)\in
An argument can be made that because O(nlg(n)+mlg(m))\). An argument can be made that because
<code>queries[i],items[i][{0,1}]</code>\(\leq10^9\), radix sort <code>queries[i],items[i][{0,1}]</code>\(\leq10^9\), radix sort
can be leveraged to achieve a time complexity of \(O(d \cdot (n + can be leveraged to achieve a time complexity of \(O(d \cdot (n +
k + m + k)) = O(9 \cdot (n + m + 20)) = O(9n+9m + 180) = O(9n+9m) k + m + k))\in O(9\cdot (n + m))\in O(9n+9m)\in O(9n+9m)\in
= O(n+m)\). O(n+m)\).
</p> </p>
<p> <p>
<u>Space Complexity</u>: \(\Theta(1)\), considering that \(O(m)\) <u>Space Complexity</u>: \(\Theta(1)\), considering that \(O(m)\)