Add type name to Big O table (trekhleb#717)

rmagillxyz · web-flow · commit 2a49b7045a57 · 2022-01-26T20:38:56.000+01:00
diff --git a/README.md b/README.md
@@ -305,15 +305,15 @@ Source: [Big O Cheat Sheet](http://bigocheatsheet.com/).
 
 Below is the list of some of the most used Big O notations and their performance comparisons against different sizes of the input data.
 
-| Big O Notation | Computations for 10 elements | Computations for 100 elements | Computations for 1000 elements  |
-| -------------- | ---------------------------- | ----------------------------- | ------------------------------- |
-| **O(1)**       | 1                            | 1                             | 1                               |
-| **O(log N)**   | 3                            | 6                             | 9                               |
-| **O(N)**       | 10                           | 100                           | 1000                            |
-| **O(N log N)** | 30                           | 600                           | 9000                            |
-| **O(N^2)**     | 100                          | 10000                         | 1000000                         |
-| **O(2^N)**     | 1024                         | 1.26e+29                      | 1.07e+301                       |
-| **O(N!)**      | 3628800                      | 9.3e+157                      | 4.02e+2567                      |
+| Type        | Big O Notation | Computations for 10 elements | Computations for 100 elements | Computations for 1000 elements  |
+| ----------- | -------------- | ---------------------------- | ----------------------------- | ------------------------------- |
+| Constant    | **O(1)**       | 1                            | 1                             | 1                               |
+| Logarithmic | **O(log N)**   | 3                            | 6                             | 9                               |
+| Linear      | **O(N)**       | 10                           | 100                           | 1000                            |
+| n log(n)    | **O(N log N)** | 30                           | 600                           | 9000                            |
+| Quadratic   | **O(N^2)**     | 100                          | 10000                         | 1000000                         |
+| Exponential | **O(2^N)**     | 1024                         | 1.26e+29                      | 1.07e+301                       |
+| Factorial   | **O(N!)**      | 3628800                      | 9.3e+157                      | 4.02e+2567                      |
 
 ### Data Structure Operations Complexity
 
