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 00000000..e0402369
Binary files /dev/null and b/documentation/current/_images/Rule_icon_4_2.png differ
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. 
+