diff options
| author | Anthony Wang | 2023-05-30 14:58:12 -0500 |
|---|---|---|
| committer | Anthony Wang | 2023-05-30 14:58:12 -0500 |
| commit | 1db25e6c5463be869e755ccdf1ee83b1e0a087f9 (patch) | |
| tree | ee5c2f5ef2a031fd78c80355512c9999d1be8b83 | |
| parent | 9f316d8e6ea52518316dec0a320d51c8a866446e (diff) | |
Update README with latest performance test information
| -rw-r--r-- | README.md | 4 |
1 files changed, 2 insertions, 2 deletions
@@ -1,6 +1,6 @@ # SDC -C port of [SD](https://git.exozy.me/a/SD), a very efficient flash cards app +This is a C port of [SD](https://git.exozy.me/a/SD), a very efficient (and a tiny bit overengineered) flash cards app. ## Usage @@ -12,7 +12,7 @@ If you're wondering where the name came from, this is the C port of [SD](https:/ ## 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 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 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 and [supports decks with hundreds of millions of flash cards](test.py). 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 requires `O(log N)` time. Internally SD uses [segment trees](https://en.wikipedia.org/wiki/Segment_tree) to achieve this time complexity. Some benchmark results using 10 card updates: ``` |