BASM - Fastcode project::TList.Sort Challenge

Sections

Home
Fastcode project

Introduction
Rules
AES Challenge
Ansi StringReplace Challenge
ArcCos Challenge
ArcSin Challenge
Ceil64 Challenge
CharPos Challenge
CharPosEY Challenge
CompareMem Challenge
CompareStr Challenge
CompareText Challenge
Complex Rectangular Number Addition
Complex Rectangular Number Division
Complex Rectangular Number Multiplication
Complex Rectangular Number Subtraction
Complex RectToPol Challenge
Complex PolToRect Challenge
Complex Polar Number Addition Challenge
Complex Polar Number Subtraction challenge
Fillchar Challenge
Floor64 Challenge
GCD32 Challenge
IntToStr Challenge
Int64Div Challenge
Int64Mul Challenge
IsPrime Challenge
LowerCase Challenge
MaxInt Challenge
MaxInt64 Challenge
MaxFP Challenge
Memory Manager Challenge
MinFP Challenge
MinInt Challenge
MinInt64 Challenge
Move Challenge
Pos Challenge
PosEX Challenge
PosIEx Challenge
Power Challenge
RGBA TO BGRA Challenge
Round Challenge
Round To EX Challenge
Round32 Challenge
Scale Down Challenge
StrComp Challenge
StrCopy Challenge
TList.Sort Challenge
Trunc Challenge
Trunc32 Challenge
UpperCase Challenge

Last rev.
03-10-2005 21:08

You are here: Home > Fastcode project > TList.Sort Challenge

The Fastcode Project

TList.Sort Challenge

The objective is to build the fastest replacement for RTL TList.Sort. This challenge is blind.

Validation and Benchmark Tool:

To do for Sort B&V version 0.9:
- Change validation to comply with vote results (inconsistent compare functions)
- Change benchmarking to comply with vote results (killer sequences)
- Test and maximize benchmark stability

Tables of results