Ah! Thanks, corrected now and all fine. RBS "Schmidt" <sss@online.de> wrote in message news:OvxrfbIgIHA.4536@TK2MSFTNGP06.phx.gbl... "RB Smissaert" <bartsmissaert@blueyonder.co.uk> schrieb im Newsbeitrag news:uQS$TMIgIHA.5036@TK2MSFTNGP06.phx.gbl... Or do I have this code block wrong: 50 On Error Resume Next 'spans a Long-Array (pArr()) over the StringPointers

Olaf, I just found something that seems somewhat worrying. When I run this function from VBA or if I have Remove array bounds checks unchecked then there are array out of bounds errors. First one is at this line: pV(0) = pArr((Lo + Hi) \ 2) When I put On Error Resume Next before that line then I get an out of bounds error at: Do While Arr(j) V(0) as j is -1 At a quick test it

"RB Smissaert" <bartsmissaert@blueyonder.co.uk> schrieb im Newsbeitrag news:OhgkOnDgIHA.5164@TK2MSFTNGP03.phx.gbl... [pointerbased, nonrecursive QSort for String-Arrays] I was trying to adapt this to sort 1-D 1-based string arrays, but sofar no success yet. Could anybody tell me how this should be adapted? Sorry about that, the routine was already meant to work with 1D-Stringarrays

Using a database for this definitely is overkill, but if you want to use database (as a learning experience) then SQLite seems a good option. Free, very fast and very simple. Secondly, if you want a very fast sort of a 1-D string array then this code, which I got from Olaf Schmidt will do the job. Compile with all fast compiler options: Option Explicit '***Into a form '(native compiled

I take it that TCHAR* is the equivalent of BSTR? Just asking so I can file it away for future reference if it is. Rob "Tony Proctor" <tony_proctor@aimtechnology_NoMoreSPAM_.com> wrote in message news:eryaILD0HHA.3788@TK2MSFTNGP02.phx.gbl... Since the C++ code is already waiting for a real Unicode BSTR argument then it should be just a matter of changing the VB code For