// *Sorting Laboratory* Copyright (C) Krzysztof Bosak 2000-06-16..2000-06-16 #include #define EASSERT assert #include "l3_sort.h" int main() { /* BUGS autoarray original(21); original[0]="AFile1.txt"; original[1]="Afile2.txt"; original[2]="AFile10.txt"; original[3]="Copy of File.txt"; original[4]="Copy (2) of File.txt"; original[5]="Copy (3) of File.txt"; original[6]="Decimal 0.0"; original[7]="Decimal 1.2"; original[8]="Decimal 1.23"; original[9]="Decimal 1.3"; original[10]="IP 0.0.0.0"; original[11]="IP 255.7.45.192"; original[12]="IP 255.32.97.204"; original[13]="IP 255.32.123.8"; original[14]="Letter.txt"; original[15]="Letter 2.txt"; original[16]="Letter03.txt"; original[17]="Letter 04.txt"; original[18]="Product2.txt"; original[19]="Product4.txt"; original[20]="Product3214567890.txt"; autoarray sorting(original); int i; for(i=0; i<100; i++) { const int i1=RAND.irandom(21); const int i2=RAND.irandom(21); if(i1!=i2) { const TextString temp=sorting[i1]; sorting[i1]=sorting[i2]; sorting[i2]=temp; } } AlphanumericSorting(sorting); for(i=0; i