From cbb3f1a9b1f9850b36a635d591793b35405925bf Mon Sep 17 00:00:00 2001 From: Karl Gaissmaier Date: Sun, 29 Jan 2023 13:42:56 +0100 Subject: [PATCH] README --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index e659bcb..dc61256 100644 --- a/README.md +++ b/README.md @@ -15,7 +15,7 @@ The implementation is based on treaps, augmented for intervals. Treaps are rando Immutability is achieved because insert/delete will return a new treap which will share some nodes with the original treap. All nodes are read-only after creation, allowing concurrent readers to operate safely with concurrent writers. -The time complexity is **O(log(n))** or **O(k*log(n))** where k is the number of returned items, the space complexity is **O(n)**. +The time complexity is **O(log(n))** or **O(k+log(n))** where k is the number of returned items, the space complexity is **O(n)**. ``` Insert() O(log(n))