'Stringsort for CMM2 (5.05.04RC5/400MHz) - test program

option base 0
option explicit

const MAX_ARRAY =1000
const MAX_LENGTH= 20
const LF$       =chr$(10)

DIM S$(MAX_ARRAY) LENGTH MAX_LENGTH
DIM  temp$,i,ts

S$(0) = "John"
S$(1) = "Aaron"
S$(2) = "Eric"

for i = 0 to 2
? S$(i)
next

? "Creating"MAX_ARRAY" random strings ..."

for i = 3 to MAX_ARRAY-1
S$(i) = RNDSTR$(20)
next

timer = 0
StringSort S$(), MAX_ARRAY, 20
ts=timer

temp$=S$(0)
'S$(30)="AAAAA" ' just for testing!

for i = 0 to MAX_ARRAY-1
 ? S$(i),temp$

 if S$(i)<temp$ then ? "Sorting Error at element " i:end
 temp$=S$(i)
next


? LF$ "Array successfully sorted!" ts "ms for " MAX_ARRAY " elements"


' create a random string
Function Rndstr$(s_len as integer) as string
local i%

for i% = 1 to s_len
   Rndstr$=Rndstr$+chr$(rnd*32+64)
next i%
' ? Rndstr$
End Function

end '*************************************************************


'File StringSort.bas written 26-07-2020 15:54:17
'matherp's StringSort for MM2 ported to CMM2
'StringSort ArrayOfStrings$(), NbrOfStrings, ElementLength
CSUB StringSort
 00000000
 'stringsort
 B091B480 60F8AF00 607A60B9 E9D3687B 46132300 627B3301 637B2301 E9D368BB
 46132300 E08D623B 637B2300 63BB2301 6BBBE083 FB026A7A 461AF303 441368FB
 6BBB61FB 6A7A3B01 F303FB02 68FB461A 61BB4413 781A69FB 781B69BB BF284293
 B2DB4613 69BB63FB 62FB3301 330169FB 230062BB E016633B 781A6AFB 781B6ABB
 D901429A 633B2301 781A6AFB 781B6ABB D202429A 33FFF04F 6AFB633B 62FB3301
 33016ABB 6BFB62BB 63FA1E5A D0022B00 2B006B3B 6B3BD0E0 D1102B00 781A69BB
 781B69FB D901429A 633B2301 781A69BB 781B69FB D202429A 33FFF04F 6B3B633B
 D1272B01 781A69FB 781B69BB BF384293 B2DB4613 6BFB63FB 63FB3301 62FB69BB
 62BB69FB 6AFBE00F 75FB781B 781A6ABB 701A6AFB 7DFA6ABB 6AFB701A 62FB3301
 33016ABB 6BFB62BB 63FA1E5A D1EA2B00 637B2301 33016BBB 6BBA63BB 429A6A3B
 AF77F6FF 2B006B7B AF6EF47F 3744BF00 F85D46BD 47707B04
End CSUB

'File IntegerSort.bas written 31-07-2020 01:26:41
CSUB IntegerSort INTEGER, INTEGER
 00000000
 '
 B089B480 6078AF00 683B6039 2300E9D3 613B4613 61FB693B 69FBE040 E03961BB
 00DB69BB 4413687A 2300E9D3 2302E9C7 617B69BB 697AE011 1AD369FB 687A00DB
 697A4413 687900D2 E9D34411 E9C12300 697A2300 1AD369FB 697A617B 429A69FB
 697ADB0D 1AD369FB 687A00DB E9D34413 E9D72300 42900102 0303EB71 697BDBDB
 687A00DB E9D718D1 E9C12302 69BB2300 61BB3301 693B69BA DBC1429A 2B0069FB
 3301DA00 61FB105B 2B0069FB BF00D1B5 3724BF00 F85D46BD 47707B04
End CSUB

#include "ARMCFunctions.h"
// quicksort from rosetta stone
void quicksort(long long A[], long long *nElements) {
 long len=*nElements;
if (len < 2) return;

 long long pivot = A[len / 2];

 long long i, j;
 for (i = 0, j = len - 1; ; i++, j--) {
   while (A[i] < pivot) i++;
   while (A[j] > pivot) j--;

   if (i >= j) break;

   long long temp = A[i];
   A[i]           = A[j];
   A[j]           = temp;
 }

 quicksort(A, i);
 quicksort(A + i, len - i);
}

' File quicksort.bas written 01-08-2020 22:45:21
' quicksort ArrayOfIntegers%(), MAXELEM%
' staring at element 0!
CSUB quicksort INTEGER,INTEGER
 00000000
 'quicksort
 4FB0E92D AF00B092 61396178 E9D3693B 46132300 6BFB63FB F3402B01 6BFB80A4
 DA002B00 105B3301 697A00DB E9D34413 E9C72300 F04F230C F04F0200 E9C70300
 6BFB2308 461A3B01 73E2EA4F 2310E9C7 E9D7E00A 1C512308 F14360B9 60FB0300
 2302E9D7 2308E9C7 2308E9D7 00DB4613 4413697A 0100E9D3 230CE9D7 EB714290
 DBE60303 E9D7E00B F1122310 603931FF 33FFF143 E9D7607B E9C72300 6C3B2310
 697A00DB E9D34413 E9D72300 4290010C 0303EB71 E9D7DBE7 E9D70108 42902310
 0303EB71 E9D7DA30 46132308 697A00DB E9D34413 E9C72300 6C3B230A 697A00DB
 E9D718D0 46132308 697A00DB E9D018D1 E9C12300 6C3B2300 697A00DB E9D718D1
 E9C1230A E9D72300 F1122308 F1430A01 E9C70B00 E9D7AB08 F1122310 F14338FF
 E9C739FF E7938910 6BFBBF00 EA4F4618 E9D771E0 1A842308 0503EB61 4506E9C7
 0320F107 69784619 FF5AF7FF 2308E9D7 00DB4613 4413697A 0218F107 46184611
 FF4EF7FF BF00E000 46BD3748 8FB0E8BD
End CSUB

asm volatile("mtc0 %0, $9": "+r"(current_ticks));

#include "ARMCFunctions.h"
// quicksort from rosetta stone
void quicksort(long long A[], long long *nElements) {
 long len=*nElements;
if (len < 2) return;

 long long pivot = A[len / 2];

 long long i, j, h;
 for (i = 0, j = len - 1; ; i++, j--) {
   while (A[i] < pivot) i++;
   while (A[j] > pivot) j--;

   if (i >= j) break;

   long long temp = A[i];
   A[i]           = A[j];
   A[j]           = temp;
 }
 h=len-i;
 quicksort(A, &i);
 quicksort(A + i, &h);
}