Alice/my_digital_garden
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

vault backup: 2023-09-25 13:14:01

Browse source
This commit is contained in:
Alice 2023-09-25 13:14:01 +01:00
parent 5b6b21e375
commit b3e325ad6c
1 changed files with 6 additions and 5 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

11
content/CP/PL - Aula 2.md
View file

@ -8,14 +8,15 @@
## Ex. 1 ## Ex. 1
a) a)
> [!help]- What is the complexity of the MM (i.e., in big O notation, where N is the problem size and NxN is the matrix size)? > [!help]- What is the complexity of the MM (i.e., in big O notation, where N is the problem size and NxN is the matrix size)?
> O()
>[!hint]- Big O Notation Cheat Sheet >[!hint]- Big O Notation Cheat Sheet
>- Constant: O(1) >- Constant: O(1)
- Linear time: O(n) >- Linear time: O(n)
- Logarithmic time: O(n log n) >- Logarithmic time: O(n log n)
- Quadratic time: O(n^2) >- Quadratic time: O(n^2)
- Exponential time: O(2^n) >- Exponential time: O(2^n)
- Factorial time: O(n!) >- Factorial time: O(n!)
>[!help]- What increase in execution time is expected when the N doubles? >[!help]- What increase in execution time is expected when the N doubles?