Have to sort really fast

Started by
20 comments, last by Hippokrates 21 years, 8 months ago
quote:Original post by DrPizza
I think you should be able to radix sort them quite effectively, if a little memory-intensively.
IIRC, radix sorting a linked list takes a little over 1k of stack space. Not quite what I'd call memory-intensive.

EDIT: make that 2k, actually.

[edited by - Beer Hunter on August 17, 2002 5:04:55 AM]
Advertisement
so you need them sorted by z and by texture? Try two lists with pointers to the data. So they would both have the same pointers, but in different order.

This topic is closed to new replies.

Advertisement