admin/developer-roadmap
1
0 Fork 0
Code Issues Pull Requests Actions 2 Packages Projects Releases Wiki Activity

Fix Polynomial Time Complexity (#4836)

Browse Source
This commit is contained in:
Mahyar authored and GitHub committed 2023-12-13 05:31:22 +06:00
1 parent 90df308751
commit 5b03601aa2
1 file changed
+1 -1
Download Patch File Download Diff File Expand all files Collapse all files
src/data/roadmaps/computer-science/content/103-asymptotic-notation/103-common-runtimes/index.md
+1 -1
View File
@@ -10,7 +10,7 @@ Given below is the list of common algorithmic runtimes. The runtimes are listed
- O(n^3) - Cubic
- O(2^n) - Exponential
- O(n!) - Factorial
- O(n^n) - Polynomial
- O(n^k) - Polynomial
Visit the following resources to learn more: