From a8f312684bbb3e17442696065faa196fe0eac5c8 Mon Sep 17 00:00:00 2001
From: halw <halw@abb3cda0-5349-4a8f-a601-0c33ac3a8c38>
Date: Tue, 15 Mar 2011 01:02:41 +0000
Subject: [PATCH] Author:halw Date:2011-03-15T01:02:41.000000Z

git-svn-id: https://svn.eiffel.com/eiffel-org/trunk@847 abb3cda0-5349-4a8f-a601-0c33ac3a8c38
---
 documentation/current/_images/Rule_icon_4_2.png  | Bin 0 -> 1240 bytes
 .../current/_images/Rule_icon_4_2.png.data       |   3 +++
 .../scoop-examples/quicksort.wiki                |   6 ++++++
 3 files changed, 9 insertions(+)
 create mode 100644 documentation/current/_images/Rule_icon_4_2.png
 create mode 100644 documentation/current/_images/Rule_icon_4_2.png.data

diff --git a/documentation/current/_images/Rule_icon_4_2.png b/documentation/current/_images/Rule_icon_4_2.png
new file mode 100644
index 0000000000000000000000000000000000000000..e0402369cee98da094dead346e0848ade2b66cd7
GIT binary patch
literal 1240
zcmV;}1Sk86P)<h;3K|Lk000e1NJLTq000;O000;W1^@s6;CDUv00009a7bBm000XU
z000XU0RWnu7ytkSib+I4R7ee#RefwzRTMw>zV}K3F_KKmCQ4!^$!doT8OF`;P9^>!
zAqyoNTB9aR<&la0F*+y8qMO4gG0eikl0hQQN*6IP5vQ|=5-^JfwB6e1^bZp=>7rtg
zEPG$qbMAa^uUq}P$?N?%=l*`@{_Z)qOb7x0wIv={>X5HcRd!S3jzWEG&+>oU%l?UA
ze0<ztj7f}iTOBksw+f+}Y&dyPXeKaI1Hmtwds~MuKl^t?r3fTqE|;@u69qsdAGh6Z
zIGUwhbN$UMT)Pe}8gm@S`1GAO6c=1Seo=MDZeNnX2aecGSh?fy+2L2fHq0JpiMC4<
zAZ$yuz?j~5_rtC2imJlNWUmbtaPsk=Xg&eU=ksxly337#`gF$~3`|o5t7{2FMm+h=
z*&ZdJ#cfcHiq-2EMIYJ*=?{*b$({PJPJjO*clUb(TwoIu6M^~Q6g`2H-qEWkJqapq
ztcwS$YJp@cWX_5cNBcy@%IoR~*i8l+O9G6#ohF81Oe4YUt<nNEl7`yOh6)A&MMPIl
zGWk9BxXh>(m9<Ro8kqVaGYaW94@zG;l^o!YE0L52FRjbX8ge+<aVrSZ0sX!ebEJ_b
zUtZfHb>y_PnW`#&%YGrpB_$$h{NR~Ph7mZ)aO}rxZHP3@$f!=I04&>v@NPMcKDwPn
zAGs4W%aY)0w>&c!40`zQKyIKP<I=A%HTa~kP<NU$uz2dosX%V|#u>ORin*)If`s=t
za6_XUlWgQ$AA7!tKuUyZDfJ`=YBFmaM}j*XM0w>}Z&UU9dKL;}qK0?V8iTPHMdG>F
zWQtNiDi&Z#iO_jYTLh16ZGp&ET>=-rI|o01e@;y1M|(_w0@&dx3IxF&NGDM;;QHPH
z_S8!QJh-}!EyyBtB_K~OtX*Ryc}NITh<ln^7!lpIWjiRU*7o_^i84?jDEF{1OMLW`
z3@mlDAD56FQx@$Gk?h~Fq}$CR@XM6VX5sg*hQ#!@Bfzn09l<PN8~g5!?Q9QK)f5sh
zY%9a_a@#h06yR~tG#0E}BMSL1B?+Bo|I@LTsSv%Wr3Jvdi!0Y{X64O&EYhqi_!KQt
z6fOSA;DH&6z9FhJ365)#SS!=to#J#i7O3+5N*z8RcD%YPzO3pN$2$QLP{H{tnNH%i
zYLQ_h$%MllK*?Gld;UBtjE_or^!I-89=z8Zms<4F(p_xaTqFDhUZ(u@*wI`9ASn<T
z7NS_gzc$l@hXO9K-rdhIRp%=~&jl7V6rI2$pw071TtMnWp^z7`f4#(5_?anM`E_=7
zG6KO*+67)S{xP6cK<L7S0HD1DSg9p^?1dzez`dKU`lEbR&0@-XfAfkBv&CI6rN3+Q
z_Z%<Qq!jJlRAyq)F7_MUF<mT;qYu`LX!i+0y|i)8`eUnP=D5DTUixr))bPWs22PRs
z9H{)fv@Kev3EA+{>D}tvaK*9(_SxbE6(yqRP$$l5Ly;rW5-AlM7L$^C>kOLjFLI&D
z6T_EgpN<6<WT6!NpN%$ncQJ3Tw>~yD);%;d)bS@WZ8eql&1;7M0000<MNUMnLSTYS
CxI&u%

literal 0
HcmV?d00001

diff --git a/documentation/current/_images/Rule_icon_4_2.png.data b/documentation/current/_images/Rule_icon_4_2.png.data
new file mode 100644
index 00000000..89e76614
--- /dev/null
+++ b/documentation/current/_images/Rule_icon_4_2.png.data
@@ -0,0 +1,3 @@
+title=LogoRule
+author=halw
+path=content/logorule
diff --git a/documentation/current/solutions/concurrent-computing/concurrent-eiffel-scoop/scoop-examples/quicksort.wiki b/documentation/current/solutions/concurrent-computing/concurrent-eiffel-scoop/scoop-examples/quicksort.wiki
index 8a57fc54..89ab9bf0 100644
--- a/documentation/current/solutions/concurrent-computing/concurrent-eiffel-scoop/scoop-examples/quicksort.wiki
+++ b/documentation/current/solutions/concurrent-computing/concurrent-eiffel-scoop/scoop-examples/quicksort.wiki
@@ -16,5 +16,11 @@ In the SCOOP example, instead of recursive calls, substructures are handled by s
 
 =Highlights=
 
+The quicksort example sorts a randomly generated container of integers. The set-up for this example is done in the root class. It is interactive in the sense that when you run the example, you get to to choose how many elements will be sorted (within certain limits) and you get to provide a seed for the random number generator which will be used to produce the unsorted structure.
+
+The quicksort algorithm is embodied in the class <code>QUICKSORTER</code>, specifically in its routine <code>sort</code>. Instances of <code>QUICKSORTER</code> declared as <code>separate</code> are spawned to sort substructures as the algorithm progresses.
+
+The structures acted upon by <code>QUICKSORTER</code> are instances of class <code>DATA</code>. <code>DATA</code> is a class designed specifically to support this example. 
+