info/developer-roadmap
1
0
Fork 0
mirror of https://github.com/kamranahmedse/developer-roadmap.git synced 2025-08-01 06:50:26 +02:00
Code Issues Releases Wiki Activity

Fix Polynomial Time Complexity (#4836)

Browse Source
This commit is contained in:
Mahyar
2023-12-13 03:01:22 +03:30
committed by GitHub
parent 90df308751
commit 5b03601aa2
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
src/data/roadmaps/computer-science/content/103-asymptotic-notation/103-common-runtimes/index.md
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: