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



There's nothing magic about a sort. It has to make a pass through the array at least once. In the example given, the array was already in ascending order so it didn't even sort anything. .

Albert

----- Original Message -----
From: "Barbara Morris" <bmorris@xxxxxxxxxx>
To: rpg400-l@xxxxxxxxxxxx
Subject: Re: Function to find the greatest or smallest value
Date: Fri, 24 Apr 2009 13:46:18 -0400


Asher613Smith@xxxxxxx wrote:
I may stand corrected. Or maybe not. Needs more investigation,
because I know that doing a test on each pass through the loop
is costly. The sort can be optimized.


Even if a sort can be optimized, it is unlikely for it to become as fast
as a single pass through the array.

It's easy to check which is more efficient.

Here are two programs:
http://code.midrange.com/63012b7f6b.html - uses a loop
http://code.midrange.com/58e7279cbd.html - uses SORTA

Here is the output of the two programs, first the loop, then SORTA. The
SORTA way is almost 5 times slower.

5 > call perf1 100000
DSPLY 2009-04-24-13.16.42.394000
DSPLY 2009-04-24-13.16.52.657000
DSPLY 10 seconds
5 > call perf2 100000
DSPLY 2009-04-24-13.16.58.283000
DSPLY 2009-04-24-13.17.45.514000
DSPLY 47 seconds

--
This is the RPG programming on the IBM i / System i (RPG400-L) mailing list
To post a message email: RPG400-L@xxxxxxxxxxxx
To subscribe, unsubscribe, or change list options,
visit: http://lists.midrange.com/mailman/listinfo/rpg400-l
or email: RPG400-L-request@xxxxxxxxxxxx
Before posting, please take a moment to review the archives
at http://archive.midrange.com/rpg400-l.




As an Amazon Associate we earn from qualifying purchases.

This thread ...


Follow On AppleNews
Return to Archive home page | Return to MIDRANGE.COM home page

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.