lgallet/epicours
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

vault backup: 2023-09-15 16:01:53

Browse Source
This commit is contained in:
Louis Gallet 2023-09-15 16:01:53 +02:00
parent 9f6aa09c01
commit ffe134144f
Signed by: lgallet
SSH Key Fingerprint: SHA256:qnW7pk4EoMRR0UftZLZQKSMUImbEFsiruLC7jbCHJAY
1 changed files with 2 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
Algo/Séminaire/Chapter 5 - Recursivity.md
View File

@ -132,4 +132,5 @@ The best algorithm in term of complexity is the parameter that is constant/linea
| | |$0(n)$|$O(2^n)$| | | |$0(n)$|$O(2^n)$|
<img src="https://imgur.com/6OWREOm.png" height=400 width=auto/> <center><img src="https://imgur.com/6OWREOm.png" height=400 width=auto/></center>
This function is not optimize because the number of calls is growing exponentially