| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Bump version to v0.2.3 | Andinus | 2022-01-12 | 1 | -0/+2 |
| | | |||||
| * | Re-implement octans, move subroutines to respective modules | Andinus | 2021-01-19 | 1 | -0/+1 |
| Initially it went over the list of words & checked if they exist in the grid. This was very slow. Currently it walks the grid & checks if the current string exist in the dictionary. This is faster for these reasons: • The dictionary is sorted, we perform binary range search on the dictionary to return the list of all words that start with specific string. • Starting positions are limited. If the dictionary wasn't sorted then this probably would've been | |||||