We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent f611558 commit 8325576Copy full SHA for 8325576
shared/middle/sicp.md
@@ -28,7 +28,7 @@ This fundamental work emphasizes controlling the complexity of software systems
28
* What is `Θ(n)` notation used for?
29
* What does grow faster: `Θ(log(n))` or `Θ(sqrt(n))`?
30
* What does grow faster: `Θ(n)` or `Θ(1000*n)`?
31
- * What does grow faster: `Θ(n*2)` or `Θ(n^2)`? *`^2` means power of two*.
+ * What does grow faster: `Θ(n*2)` or `Θ(n²)`?
32
* What are probabilistic algorithms?
33
34
* [1.3 Formulating Abstractions with Higher-Order Procedures](http://mitpress.mit.edu/sites/default/files/sicp/full-text/book/book-Z-H-4.html#%_toc_%_sec_1.3)
0 commit comments