diff options
2 files changed, 4 insertions, 1 deletions
| -rw-r--r-- | Year 2/Design and analysis of algorithms/Homeworks/Homework2.pdf | bin | 65529 -> 65723 bytes | |||
| -rw-r--r-- | Year 2/Design and analysis of algorithms/Homeworks/Homework2.tex | 5 |
diff --git a/Year 2/Design and analysis of algorithms/Homeworks/Homework2.pdf b/Year 2/Design and analysis of algorithms/Homeworks/Homework2.pdf Binary files differindex d78e80f..5005f94 100644 --- a/Year 2/Design and analysis of algorithms/Homeworks/Homework2.pdf +++ b/Year 2/Design and analysis of algorithms/Homeworks/Homework2.pdf diff --git a/Year 2/Design and analysis of algorithms/Homeworks/Homework2.tex b/Year 2/Design and analysis of algorithms/Homeworks/Homework2.tex index 69d7d77..c18d1d9 100644 --- a/Year 2/Design and analysis of algorithms/Homeworks/Homework2.tex +++ b/Year 2/Design and analysis of algorithms/Homeworks/Homework2.tex @@ -65,7 +65,7 @@ \title{\vspace{-1.5cm}Домашно №2 по ДАА на Компютърни Науки} \author{Камен Димитров Младенов, Група 6} -\date{9 Април 2023} +\date{7 Април 2023} \begin{document} @@ -224,6 +224,9 @@ int isinteresting(array<int, int> M) { От II., следва че $M[i-2,j] + M[i,j+1] \leq M[i-2,j+1] + M[i,j]$.\newline За $M[i-1,j-1]$ и $M[i-2,j]$ твърдението е съответно вярно при $1 \leq p \leq i-2, 1 \leq q \leq j-2$ и $1 \leq p \leq i-3, 1 \leq p \leq j-1$ по ИП.\newline Следователно, твърдението е изпълнено за $M[i,j+1]$ при $1 \leq p \leq i-2, 1 \leq q \leq j-1$. + + \item Аналогично твърдението е изпълнено при $i+1$ и $j$ + \item Аналогично твърдението е изпълнено при $i+1$ и $j+1$ \end{enumerate} |
