From 63b3abb7fc13cdeda8617f1b3554007947e9ef72 Mon Sep 17 00:00:00 2001 From: Mohammed Al-Ameen Date: Fri, 10 Jun 2022 10:00:20 +0200 Subject: [PATCH] add Benchmarks anchor link --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index de84d43..62bd11d 100644 --- a/README.md +++ b/README.md @@ -20,7 +20,7 @@ get intersections. Maybe you want a set implementation? Then this is one, but there are other reasons. If you are using your hash maps/arrays like sets or do a lot of checks to see if items exists in your hash maps then NSet might make sense. -In such cases NSet makes sense because it is both faster and more memory efficient. You can see more about this in the Benchmarks section. +In such cases NSet makes sense because it is both faster and more memory efficient. You can see more about this in the [Benchmarks](#benchmarks) section. Here are some examples where you might want to consider NSet: