aboutsummaryrefslogtreecommitdiff
path: root/README.md
diff options
context:
space:
mode:
authorAnthony Wang2022-04-21 12:20:08 -0500
committerAnthony Wang2022-04-21 12:20:08 -0500
commit9a02456aeb6105e34d56caaaf8b02c50fcd57df8 (patch)
tree5a741597a31be90303f2b10b8eb46d9d7e300df6 /README.md
parenta356cd042558d4206917f843809fdf22e9fcf990 (diff)
parentb0568c843e729adbea9606184c5247de0f7d41b4 (diff)
Merge branch 'main' of git.exozy.me:Ta180m/SD
Diffstat (limited to 'README.md')
-rw-r--r--README.md2
1 files changed, 1 insertions, 1 deletions
diff --git a/README.md b/README.md
index 676065f..b04d215 100644
--- a/README.md
+++ b/README.md
@@ -14,4 +14,4 @@ If you're wondering where the name came from, I named this app after a common ty
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 is planned but will probably never happen.
+A C port for maximal speed and minimal executable size can be found [here](https://git.exozy.me/Ta180m/CD).