Arrays needed for quicksort

The fastest single processor

sort method is quicksort.

Quick sort implements an array

to perform its sort.

I have a wireframe editor project

that holds its data in a

linked-list. This simplifies the

implementation of the project's

editing functions.

I needed a fast method to

re-order the triangles in

wireframe models according to

their Z coordinates.

So I implemented an array of

linked-list referrences in a

quicksort method. The results

is exceptional.

Moral:

The fastest single processor

data sorting algorithm in

computer history requires an

array to perform.