From b3e325ad6c01999ca8565b651974aeb61121c853 Mon Sep 17 00:00:00 2001
From: Alice <alicevteixeira@gmail.com>
Date: Mon, 25 Sep 2023 13:14:01 +0100
Subject: [PATCH] vault backup: 2023-09-25 13:14:01

---
 content/CP/PL - Aula 2.md | 11 ++++++-----
 1 file changed, 6 insertions(+), 5 deletions(-)

diff --git a/content/CP/PL - Aula 2.md b/content/CP/PL - Aula 2.md
index 26ab03e..1e28ab9 100644
--- a/content/CP/PL - Aula 2.md	
+++ b/content/CP/PL - Aula 2.md	
@@ -8,14 +8,15 @@
 ## Ex. 1
 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)?
+> O()
 
 >[!hint]- Big O Notation Cheat Sheet
 >- Constant: O(1)
-- Linear time: O(n)
-- Logarithmic time: O(n log n)
-- Quadratic time: O(n^2)
-- Exponential time: O(2^n)
-- Factorial time: O(n!)
+>- Linear time: O(n)
+>- Logarithmic time: O(n log n)
+>- Quadratic time: O(n^2)
+>- Exponential time: O(2^n)
+>- Factorial time: O(n!)
 
 >[!help]- What increase in execution time is expected when the N doubles?