mirror of
https://github.com/kamranahmedse/developer-roadmap.git
synced 2026-09-24 15:00:31 +08:00
Merge pull request #5713 from YutharsanS/patch-1
Change of content in 104-exponential.md
This commit is contained in:
+1
-1
@@ -6,7 +6,7 @@ Exponential algorithms are those that grow at a rate of 2^n. This means that for
|
||||
def exponential(n):
|
||||
if n == 0:
|
||||
return 1
|
||||
return 2 * exponential(n - 1)
|
||||
return exponential(n - 1) + exponential(n - 1)
|
||||
```
|
||||
|
||||
As you can see, the algorithm's runtime grows exponentially. For each additional input, the algorithm will take twice as long to run.
|
||||
|
||||
Reference in New Issue
Block a user