2 ms·
Actually in the real world browsing files by access or modified time is usually quicker because the number of items is small. There may be a set of 10-20 files
by justinhj 11y ago
Actually in the real world browsing files by access or modified time is usually quicker because the number of items is small. There may be a set of 10-20 files that I've recent opened and the one I want will be in the top 3-5 very often. Doing a binary search invokes scrolling up and down a large list.
- mrob 11y agoThat makes sense for a "Recent files" menu in applications, but if I'm using a general purpose file browser I'm probably looking for something I haven't used recently.
- tamana 11y agoPeople are really really good as estimating and sorting access time and creation time, though, so we can binary search through that. People who use paper journals report they are really could at finding items by remembering when the related activity happened. Emacs org mode (or is it TODO.txt, I forget) also uses this principle.