From 30fa5883e0f7a71ad28041e08a8b6ede0d5c7570 Mon Sep 17 00:00:00 2001
From: Martin Mares <mj@ucw.cz>
Date: Tue, 21 Apr 2009 13:38:52 +0200
Subject: [PATCH] Drobny bugfix QS.

---
 slides/Makefile      | 2 +-
 slides/quicksort.tex | 6 ++++--
 2 files changed, 5 insertions(+), 3 deletions(-)

diff --git a/slides/Makefile b/slides/Makefile
index a015c78..66b2d89 100644
--- a/slides/Makefile
+++ b/slides/Makefile
@@ -1,4 +1,4 @@
-all: dijkstra.ps
+all: quicksort.ps
 
 %.dvi: %.tex slidemac.tex
 	csplain $<
diff --git a/slides/quicksort.tex b/slides/quicksort.tex
index 735a8cb..c512275 100644
--- a/slides/quicksort.tex
+++ b/slides/quicksort.tex
@@ -43,8 +43,10 @@ $\<Sort>(X, a, b):$ {\cmt (set
 \::Dokud $l \le r$, opakujeme:
 \:::Dokud $X[l]<p$: $l\leftarrow l+1$.
 \:::Dokud $X[r]>p$: $r\leftarrow r-1$.
-\:::$X[l] \leftrightarrow X[r]$.
-\:::$l\leftarrow l+1$, $r\leftarrow r-1$.
+\:::Je-li $l\le r$:
+\::::$X[l] \leftrightarrow X[r]$
+\::::$l\leftarrow l+1$
+\::::$r\leftarrow r-1$
 \:$\<Sort>(X, a, r)$, $\<Sort>(X, l, b)$.
 \endalgo
 
-- 
2.39.2