3 ms·
Just to pick a random example: creating an SQL database with an index for faster search requires sorting
by frankreyes 4y ago
Just to pick a random example: creating an SQL database with an index for faster search requires sorting
- Someone 4y agoExcept for the special case of loading data into an empty table that already has an index, that requires repeatedly inserting items in a sorted ‘list’ (more likely a btree), keeping it sorted. That’s quite a different thing.
- frankreyes 4y ago>btree That's literally a collection of arrays that needs to be sorted. And it's still a traditional sorting.