 Sorted arrays with binary search are a very inefficient solution when insertion and deletion operations are interleaved with retrieval, taking formula_149 time for each such operation.In addition, sorted arrays can complicate memory use especially when elements are often inserted into the array.There are other data structures that support much more efficient insertion and deletion.