For some application such as a text editor the best representation
of sequences may be a hybrid of linked and sequential allocation,
sometimes called a `rope` implementation. Such a hybrid
links together sequentially allocated blocks of elements (arrays).
If the size of blocks is bounded by a constant, then the
asymptotic complexity of sequence operations in the hybrid
implementation is identical to the corresponding singly or doubly
linked list implementation. But the leading constant in the
polynomial approximating the running time
may be much lower.