Timeline for Algorithm for indexing strings in "list"
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 29, 2014 at 14:38 | comment | added | user22815 | If you want to use a single file, I would recommend either a binary format with a table of contents or keep the text file but store a second file with metadata. This metadata would include offsets to different buckets. This is important because strings in a natural language tend to be skewed toward certain letters (buckets). A binary search is efficient, but you have a priori knowledge which can make it better: hence, the bucket sort. | |
| Apr 29, 2014 at 10:39 | comment | added | apocalypse | I considering this (algorithm). But I would stay in one file instead of many. | |
| Apr 28, 2014 at 19:21 | history | edited | user22815 | CC BY-SA 3.0 |
Added "benefits" section.
|
| Apr 28, 2014 at 17:11 | history | answered | user22815 | CC BY-SA 3.0 |