Looking for thoughts/opinions:
-------------quote-------------
You could simply write your own sort algorithm (like a bubble sort) and encapsulate it in a function, however there's another way that's faster, while remaining very flexible. The key is using the JScript array's highly efficient sort method
--------------finish quote-----
Ref:
http://www.aspfaqs.com/aspfaqs/ShowFAQ.asp?FAQID=83
------------------------------
My two cents worth:
I dont question the above information, wouldnt dare....
However, I find it a bit weird skipping between jScript and vbScript could be the most efficient method of array sorting. Does anybody have the time to explain how this could be?
My objective:
I have a project that requires an audit tool, I am convinced - extracting info from DB (very possible large amounts of data) populating array(s) then sorting is the most resource efficient method. While sorting I will be checking/refining existing arrrays, creating new arrays etc....
Summary:
This brings me back to my intial question (start of this post)
"What is considerd the most efficient method of sorting an array?"
Should I use this vbScript/jsScript method?
OR
Go with my usual multiple nested FOR loops?
Thank you in advance
Wind is your friend
Matt