summaryrefslogtreecommitdiff
path: root/day2/tda.tex
diff options
context:
space:
mode:
authorSantosh G. Vattam2009-10-09 12:10:46 +0530
committerSantosh G. Vattam2009-10-09 12:10:46 +0530
commit8edfaa6a00a5d0f13b57a53d0e1804a94f343a8d (patch)
treec3f8b0baafbba52e00fa80809f0fe7aec6a863c0 /day2/tda.tex
parent97fa2f26647b1dc437779aed84b35d3cdb6927c8 (diff)
parent851b06f1ef9c53f64515b02a5f0bc9e584329c8d (diff)
downloadworkshops-more-scipy-8edfaa6a00a5d0f13b57a53d0e1804a94f343a8d.tar.gz
workshops-more-scipy-8edfaa6a00a5d0f13b57a53d0e1804a94f343a8d.tar.bz2
workshops-more-scipy-8edfaa6a00a5d0f13b57a53d0e1804a94f343a8d.zip
Merged branches.
Diffstat (limited to 'day2/tda.tex')
-rw-r--r--day2/tda.tex13
1 files changed, 7 insertions, 6 deletions
diff --git a/day2/tda.tex b/day2/tda.tex
index ae39f4a..664eed3 100644
--- a/day2/tda.tex
+++ b/day2/tda.tex
@@ -261,7 +261,7 @@ def test_function_ignore_cases_words():
\begin{frame}[fragile]
\frametitle{Exercise}
- Based on Euclid's theorem:
+ Based on Euclid's algorithm:
$gcd(a,b)=gcd(b,b\%a)$\\
gcd function can be written as:
\begin{lstlisting}
@@ -269,14 +269,15 @@ def test_function_ignore_cases_words():
if a%b == 0: return b
return gcd(b, a%b)
\end{lstlisting}
+ \vspace*{-0.15in}
\begin{block}{Task}
- For given gcd implementation write
- at least two tests.
- \end{block}
- \begin{block}{Task}
- Write a non recursive implementation
+ \begin{itemize}
+ \item Write at least
+ two tests for above mentioned function.
+ \item Write a non recursive implementation
of gcd(), and test it using already
written tests.
+ \end{itemize}
\end{block}
\inctime{15}