mirrors/eiffel-org
1
0
Fork 0
mirror of https://github.com/EiffelSoftware/eiffel-org.git synced 2025-12-06 14:52:03 +01:00
Code Issues Packages Projects Releases Wiki Activity

Author:halw

Browse Source 
Date:2011-03-15T01:02:41.000000Z


git-svn-id: https://svn.eiffel.com/eiffel-org/trunk@847 abb3cda0-5349-4a8f-a601-0c33ac3a8c38
This commit is contained in:
halw
2011-03-15 01:02:41 +00:00
parent 64684ea2c8
commit a8f312684b
3 changed files with 9 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

BIN
documentation/current/_images/Rule_icon_4_2.png Normal file
View File

Binary file not shown.
Side by Side

After

Width:  |  Height:  |  Size: 1.2 KiB

3
documentation/current/_images/Rule_icon_4_2.png.data Normal file
View File

@@ -0,0 +1,3 @@
title=LogoRule
author=halw
path=content/logorule

6
documentation/current/solutions/concurrent-computing/concurrent-eiffel-scoop/scoop-examples/quicksort.wiki
View File

@@ -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.