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



CRPence wrote:
...
Just curious. Why would a sort be more efficient than spinning the array in the /for loop/ as above? Does the sort not require effectively all the same work? Would a sort be more efficient than the following [just for its removal of the @max function] as well?:


The sort would be way _less_ efficient; each element would be checked many times during the sort instead of the one time during the simple loop.

A single pass through the array is order(n). RPG's SORTA opcode uses Shell sort which is order(n (log n)**2).

By the way, here's my favourite live-action sort algorithm site.
http://www.sorting-algorithms.com/

The simple loop searching for the maximum and/or minimum values would be equivalent to the first pass of the selection sort.


As an Amazon Associate we earn from qualifying purchases.

This thread ...

Follow-Ups:
Replies:

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.