From 1db25e6c5463be869e755ccdf1ee83b1e0a087f9 Mon Sep 17 00:00:00 2001
From: Anthony Wang
Date: Tue, 30 May 2023 14:58:12 -0500
Subject: Update README with latest performance test information

---
 README.md | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/README.md b/README.md
index 360f429..62d14b0 100644
--- a/README.md
+++ b/README.md
@@ -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:
 ```
-- 
cgit v1.2.3-70-g09d2