aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
-rw-r--r--README.md4
1 files changed, 2 insertions, 2 deletions
diff --git a/README.md b/README.md
index b04d215..f6cd27d 100644
--- a/README.md
+++ b/README.md
@@ -1,5 +1,7 @@
# SD
+**⚠️ SD is unmaintained!** You should use the C port [SDC](/sdc) instead.
+
Very efficient flash cards app using Go and SQLite
## Usage
@@ -13,5 +15,3 @@ 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 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.
-
-A C port for maximal speed and minimal executable size can be found [here](https://git.exozy.me/Ta180m/CD).