Use a sorted array if deletions and insertions are not going to happen often (or never). Otherwise a balanced binary search tree is usually more appropriate.