aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorAnthony Wang2022-03-29 07:44:43 -0500
committerAnthony Wang2022-03-29 07:44:43 -0500
commit0f9882eaaa4cbefa200a8204f1d3c9566912b9fc (patch)
tree8c32d875940d441b3ab278c2bc30c92eb59c8380
parent0907db1b0b365d7c0e21931c1265416d55c6f590 (diff)
Change billions to millions because sqlite slow :(
-rw-r--r--README.md2
1 files changed, 1 insertions, 1 deletions
diff --git a/README.md b/README.md
index 5eb8a83..62a88fe 100644
--- a/README.md
+++ b/README.md
@@ -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.