LZ: sorting


[Prev][Next][Index][Thread]

LZ: sorting



-> Does anyone know a short routine to sort a list?  The list is one
-> byte per element, one right after the other in memory.  The routine
-> does not necessarily have to be that fast, just short.  Thanks for
-> any help.


Insertion/Exchange Sort would probably be the best.