2 ms·
You can always sort portions of it and then merge those portions. In that case it might actually make sense to use packets on dense memory in a linked list. Yo
by CyberDildonics 11y ago
You can always sort portions of it and then merge those portions. In that case it might actually make sense to use packets on dense memory in a linked list. You could put the packet with the highest high value ahead of the other and merge middle out.
- woodman 11y agoYeah, I'd considered something like that to avoid large reallocs - I hadn't considered independent sort state for each chunk. That would allow for a single compile time constant sort index. Sounds like a good idea, thanks for that.
- CyberDildonics 11y agoNo problem, let me know how it turns out, it would be very satisfying to me if it ended up working well.