RE: Sorting a Multi-occurrence data structure -- RPG400-L

× The internal search function is temporarily non-functional. The current search engine is no longer viable and we are researching alternatives.
As a stop gap measure, we are using Google's custom search engine service.
If you know of an easy to use, open source, search engine ... please contact support@midrange.com.

Subject: RE: Sorting a Multi-occurrence data structure
From: "Fisher, Don" <Dfisher@xxxxxxxxxxxxxxxxx>
Date: Tue, 12 Nov 2002 15:07:02 -0500
List-archive: <http://archive.midrange.com/rpg400-l/>
List-help: <mailto:rpg400-l-request@midrange.com?subject=help>
List-id: RPG programming on the AS400 / iSeries <rpg400-l.midrange.com>
List-post: <mailto:rpg400-l@midrange.com>
List-subscribe: <http://lists.midrange.com/cgi-bin/listinfo/rpg400-l>,<mailto:rpg400-l-request@midrange.com?subject=subscribe>
List-unsubscribe: <http://lists.midrange.com/cgi-bin/listinfo/rpg400-l>,<mailto:rpg400-l-request@midrange.com?subject=unsubscribe>

Thanks Joel.  That explanation helped a lot.  I assumed it did something
like that, but needed some confirmation.  After all, we know what happens
when too many assumptions are made. :)

Donald R. Fisher, III
Project Manager
The Roomstore Furniture Company
(804) 784-7600 extension 2124
DFisher@roomstoreeast.com

<clip>
The following has a straight forward description of the algorithm:

http://linux.wku.edu/~lamonml/algor/sort/quick.html

<clip>

As an Amazon Associate we earn from qualifying purchases.

This mailing list archive is Copyright 1997-2024 by midrange.com and David Gibbs as a compilation work. Use of the archive is restricted to research of a business or technical nature. Any other uses are prohibited. Full details are available on our policy page. If you have questions about this, please contact [javascript protected email address].

Operating expenses for this site are earned using the Amazon Associate program and Google Adsense.