Agemixer (09:47:02)
Ok my words does not make much sense as i wrote

Agemixer (09:45:54)
Not efficient for just small.size of sort data

Agemixer (09:45:19)
(For large amounts of data to handle ofcourse)

Agemixer (09:43:36)
And could be inchunks of pointers. Optimally square rooted the complete size the pointers size for optimal

Agemixer (09:40:38)
And damn my english

Agemixer (09:40:13)
Approximating where_to if it is a put to array (string definirely)

Agemixer (09:39:06)
If i'd need to make a sort algo now, i'd make it pointer against a calue to add with a bit rolling, kind of.

Agemixer (09:36:30)
Okay..

zoi (09:34:36)
they work in theory, but not in practice

zoi (09:34:19)
no, just jokes

Lunde

Accidental

Time Left: 7:28