From 39d750fbdd3d066d31a3ca3e015a876758069b6a Mon Sep 17 00:00:00 2001
From: Syndamia <kamen@syndamia.com>
Date: Mon, 27 Mar 2023 21:01:27 +0300
Subject: [DAA/H1] Fixed last part of 3rd exercise

---
 .../Homeworks/Homework1.pdf                         | Bin 60370 -> 60329 bytes
 .../Homeworks/Homework1.tex                         |   2 +-
 2 files changed, 1 insertion(+), 1 deletion(-)

diff --git a/Year 2/Design and analysis of algorithms/Homeworks/Homework1.pdf b/Year 2/Design and analysis of algorithms/Homeworks/Homework1.pdf
index c76c68b..d1f14c3 100644
Binary files a/Year 2/Design and analysis of algorithms/Homeworks/Homework1.pdf and b/Year 2/Design and analysis of algorithms/Homeworks/Homework1.pdf differ
diff --git a/Year 2/Design and analysis of algorithms/Homeworks/Homework1.tex b/Year 2/Design and analysis of algorithms/Homeworks/Homework1.tex
index 53f2a54..f27c078 100644
--- a/Year 2/Design and analysis of algorithms/Homeworks/Homework1.tex	
+++ b/Year 2/Design and analysis of algorithms/Homeworks/Homework1.tex	
@@ -144,6 +144,6 @@ $\textsc{SomeAlg}(A, l, h)$ сортира подмасива $A[l..h]$ на $A[
 	a = 3, b = \frac{3}{2}, f(n) = c \quad \text{За } \varepsilon = 1, f(n) \preceq \frac{n^{\log_\frac{3}{2} 3}}{n}, \log_\frac{3}{2} 3 - 1 > 0 \xRightarrow[\text{Мастър Теоремата}]{\text{1 случай на}} T(n) \asymp n^{\log_\frac{3}{2} 3}
 \end{gather*}
 
-Проф. Дълбоков не е прав, проверката е нужна, понеже иначе $h - l \leq 0$ и на ред 4: $t \leq 0$, тоест условието на ред 5 никога няма да бъде изпълнено и алгоритъмът ще завърши без да сортира масива.
+Проф. Дълбоков е прав, понеже ако $l \geq h$ то $h - l \leq 0$ и на ред 4: $t \leq 0$. Условието на ред 5 никога няма да бъде изпълнено и алгоритъмът ще завърши без да извърши рекурсивни извиквания.
 	
 \end{document}
\ No newline at end of file
-- 
cgit v1.3.1-26-gb76a