Keeping a dynamic sorted range

[bearophile via Digitalmars-d]

> Let's asssume that the underlying container is a sorted 
> built-in dynamic array (that has more locality than a tree and 
> allows very fast binary searches, unlike a heap).

An array, a sorted array, is a simple data structure that often 
wins in terms of memory, simplicity, and efficiency. Generally 
it's better to not use a more complex data structure if a simpler 
one suffices.

Bye,
bearophile