diff options
author | Anthony Wang | 2022-03-29 07:44:43 -0500 |
---|---|---|
committer | Anthony Wang | 2022-03-29 07:44:43 -0500 |
commit | 0f9882eaaa4cbefa200a8204f1d3c9566912b9fc (patch) | |
tree | 8c32d875940d441b3ab278c2bc30c92eb59c8380 | |
parent | 0907db1b0b365d7c0e21931c1265416d55c6f590 (diff) |
Change billions to millions because sqlite slow :(
-rw-r--r-- | README.md | 2 |
1 files changed, 1 insertions, 1 deletions
@@ -12,6 +12,6 @@ If you're wondering where the name came from, I named this app after a common ty ## Performance -SD is designed to be extremely efficient in order to support a very large number of flash cards and should be able to handle several billion cards with ease. If `N` is the number of cards, initializing the program requires `O(N)` time and `O(N)` memory. Selecting a random card and adjusting its weight based on if the user got it correct requires `O(log N)` time. Internally SD uses [segment trees](https://en.wikipedia.org/wiki/Segment_tree) to achieve this time complexity. +SD is designed to be extremely efficient in order to support a very large number of flash cards and should be able to handle millions of cards with ease. If `N` is the number of cards, initializing the program requires `O(N)` time and `O(N)` memory. Selecting a random card and adjusting its weight based on if the user got it correct requires `O(log N)` time. Internally SD uses [segment trees](https://en.wikipedia.org/wiki/Segment_tree) to achieve this time complexity. A C port for maximal speed and minimal executable size is planned but will probably never happen. |