From 5b03601aa21f867b78cfbfe8c5d5250eaf521963 Mon Sep 17 00:00:00 2001
From: Mahyar <81903552+Mahyar-GH@users.noreply.github.com>
Date: Wed, 13 Dec 2023 03:01:22 +0330
Subject: [PATCH] Fix Polynomial Time Complexity (#4836)

---
 .../103-asymptotic-notation/103-common-runtimes/index.md        | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/data/roadmaps/computer-science/content/103-asymptotic-notation/103-common-runtimes/index.md b/src/data/roadmaps/computer-science/content/103-asymptotic-notation/103-common-runtimes/index.md
index 5427123d8..0ba08c2c0 100644
--- a/src/data/roadmaps/computer-science/content/103-asymptotic-notation/103-common-runtimes/index.md
+++ b/src/data/roadmaps/computer-science/content/103-asymptotic-notation/103-common-runtimes/index.md
@@ -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: