From a02b2b5f62752fb0ff00739aea57ab720630457b Mon Sep 17 00:00:00 2001 From: Preetham Gujjula Date: Sat, 11 May 2024 00:54:23 -0700 Subject: [PATCH] tmp --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 676c9eb..dad5746 100644 --- a/README.md +++ b/README.md @@ -26,7 +26,7 @@ an ordered list of all `f x y`, for each `x` in `xs` and `y` in `ys`. Producing $n$ elements of `applyMerge f xs ys` takes $O(n \log n)$ time and $O(\sqrt{n})$ auxiliary space, assuming that `f` and `compare` take $O(1)$ time. See -[docs/ALGORITHM.md#note-about-memory-usage](./apply-merge/blob/main/docs/ALGORITHM.md#note-about-memory-usage) +[docs/ALGORITHM.md#note-about-memory-usage](./docs/ALGORITHM.md#note-about-memory-usage) for caveats. ## Examples