From 7e29788e17560be2abb8d1983fb1b3f0ed84b72b Mon Sep 17 00:00:00 2001
From: Michael Helton <heltonmc@protonmail.com>
Date: Wed, 12 Oct 2022 12:41:21 -0400
Subject: [PATCH] fix benchmark

---
 README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/README.md b/README.md
index 21f4447..279fea2 100644
--- a/README.md
+++ b/README.md
@@ -143,7 +143,7 @@ julia> besselj(0:10, 1.0)
 In general, this provides a fast way to generate a sequence of Bessel functions for many orders.
 ```julia
 julia> @btime besselj(0:100, 50.0)
-  443.328 ns (2 allocations: 1.75 KiB)
+  398.095 ns (1 allocation: 896 bytes)
 ```
 This function will allocate so it is recommended that you calculate the Bessel functions at the top level of your function outside any hot loop.