Some algorithms to sort any COLLECTION[COMPARABLE].

Elements are sorted using increasing order: large elements at the beginning of the collection, small at the end (increasing order is implemented by class COLLECTION_SORTER).

How to use this expanded class :

         local
            sorter: COLLECTION_SORTER[INTEGER]
            array: ARRAY[INTEGER]
         do
            array := <<1,3,2>>
            sorter.sort(array)
            check
               sorter.is_sorted(array)
            end
            ...