tangled
alpha
login
or
join now
stau.space
/
hare-rope
0
fork
atom
Rope data structure implementation in Hare.
0
fork
atom
overview
issues
pulls
pipelines
docs(README.md): Update README.md
Diego Estrada
2 years ago
3e4ce304
8cc107b5
+5
-5
1 changed file
expand all
collapse all
unified
split
README.md
+5
-5
README.md
···
9
9
| --- | --- | --- |
10
10
| Index | O(log n) | **O(1)** |
11
11
| Split | O(log n) | **O(1)** |
12
12
-
| Concatenate | **O(1) amortized**, **O(log n)** worst case | O(n) |
13
13
-
| Iterate over each character | O(n) | O(n) |
12
12
+
| Concatenate | **O(1)** amort., **O(log n)** worst | O(n) |
13
13
+
| Iterate over each character | *O(n)* | *O(n)* |
14
14
| Insert | **O(log n)** | O(n) |
15
15
-
| Append | **O(1) amortized**, **O(log n)** worst case | O(1) amortized, O(n) worst case |
16
16
-
| Delete | O(log n) | O(n) |
15
15
+
| Append | **O(1)** amort., **O(log n)** worst | O(1) amort., O(n) worst |
16
16
+
| Delete | **O(log n)** | O(n) |
17
17
| Report | O(j + log n) | **O(j)** |
18
18
-
| Build | O(n) | O(n) |
18
18
+
| Build | *O(n)* | *O(n)* |
19
19
20
20
*Table taken from [Comparison with monolithic arrays](https://en.wikipedia.org/wiki/Rope_(data_structure)#Comparison_with_monolithic_arrays)*