- Random read access becomes
O(log n)
- Occupies greater overall storage space in comparison to a simple string, when not being operated upon, in order to store the parent nodes. However, this trade-off reduces as the string grows.
- Increased complexity of structure creates a greater risk of bugs.
- Significantly slower on small strings. If you’re looking at strings of 5-1000 characters, it probably doesn’t improve the performance enough to be worth it. This is another case of a data structure that is designed for the 5% of people that have an extreme situation.
- Thread-safety code makes ropes much slower.
VietMX Staff asked 3 years ago
