diff options
| author | mo khan <mo@mokhan.ca> | 2021-11-07 13:06:13 -0700 |
|---|---|---|
| committer | mo khan <mo@mokhan.ca> | 2021-11-07 13:06:13 -0700 |
| commit | f82103800d1250f9699d8c97d07adbd488a7936f (patch) | |
| tree | 2584d9083959e157e6094658db2e6640c3baed5e /notes.md | |
| parent | 5c664a3d22d5062afa95f07ac294d425247877de (diff) | |
solve 3.1.1
Diffstat (limited to 'notes.md')
| -rw-r--r-- | notes.md | 2 |
1 files changed, 1 insertions, 1 deletions
@@ -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)`. |
