summaryrefslogtreecommitdiff
path: root/notes.md
diff options
context:
space:
mode:
authormo khan <mo@mokhan.ca>2021-11-07 13:06:13 -0700
committermo khan <mo@mokhan.ca>2021-11-07 13:06:13 -0700
commitf82103800d1250f9699d8c97d07adbd488a7936f (patch)
tree2584d9083959e157e6094658db2e6640c3baed5e /notes.md
parent5c664a3d22d5062afa95f07ac294d425247877de (diff)
solve 3.1.1
Diffstat (limited to 'notes.md')
-rw-r--r--notes.md2
1 files changed, 1 insertions, 1 deletions
diff --git a/notes.md b/notes.md
index c1b4206..4cd2d1b 100644
--- a/notes.md
+++ b/notes.md
@@ -839,7 +839,7 @@ algorithms.
Natural numbers. `N = {0,1,2,...}`. This notation is useful for describing the
worst case running time of function `T(n)`.
-### 𝚯-notation
+### 𝚯-notation (theta)
The worst case running time of insertion sort is `T(n) = 𝚯(n^2)`.