I remember reading that sorting collections in sql...

# squarelibraries

[dimsuz]

I remember reading that sorting collections in sqlite can be way faster than doing it in memory (after reading from sqlite into List and then doing sort). Is that true, despite the fact that sqlite is on disk (so IO)? But there's that mmap and memory cache magic, so IO may not be as tough as it seems.

I can't recall the article I've read.

[Dominaezzz]

Might be due to convenient indexes.