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: Sorting a Multi-occurrence data structure
From: "Jon Paris" <Jon.Paris@xxxxxxxxxxxxxx>
Date: Tue, 12 Nov 2002 15:18:02 -0500
Importance: Normal
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>

 >> .... but how does QSORT determine which occurrences are passed to the
RPG procedure for comparison?  Does it make any assumptions as to the
position of the sort field?

It really doesn't matter how it determines the occurrences - depends on
which sort algorithm it uses.  But it certainly doesn't make any assumptions
about the key - it neither knows nor cares.  It just shuffles memory around
based on the high/low/equal feedback that your routine provides.

Jon Paris
Partner400

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.