News for hackers. Stuff that matters.
Re:Why is it faster to process a sorted array than an unsort... by adrianN on Friday September 15, 2017 @10:39AM (#15257505)
It might not matter for the simple case of searching through a list, but in general it makes a lot of sense to sort your data so that you improve cache locality on traversal. See for example how Frank McSherry uses Hilbert curves in graph processing: https://github.com/frankmcsherry/blog/blob/master/posts/2015...

There are no comments on this comment yet.