From db4f3f7d702da03fa4f41379094c62de4c4468a4 Mon Sep 17 00:00:00 2001
From: Max Halford <maxhalford25@gmail.com>
Date: Fri, 6 Oct 2023 00:12:43 +0200
Subject: [PATCH] Update CONTRIBUTING.md

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

diff --git a/CONTRIBUTING.md b/CONTRIBUTING.md
index 7a764c6..7803d53 100644
--- a/CONTRIBUTING.md
+++ b/CONTRIBUTING.md
@@ -6,7 +6,7 @@ We test with:
 - Tree height of 6
 - Window size of 1000
 
-The Python baseline runs in **~100 seconds**. It uses the classic left/right class-based implementation.
+The Python baseline runs in **~60 seconds** using Python 3.11 on MacOS. It uses the classic left/right class-based implementation.
 
 We coded a first array based implementation in Rust. It runs in **~6 seconds**. Each tree is a struct. Each struct contains one array for each node attribute. We wonder if we can do better by storing all attributes in a matrix.