I have wrote a search app that put found values in list but now I must to limit it - not more then 10 results. Well - if I have found Equivalent string I will put it to the first place (insert at 0 position) - all others I must store in any other position. Could you help me - what storage to choose - to fit this requirements?
so the sample search string: aa data for search in: bb, 1aa, aa, .........2aa,.........cc,............9aa,................
result on N-step (aa, 1aa, ....9aa) and we need to add 13aa so result must be (aa, 1aa, ..., 13aa) (<-put as last for simplicity)