and searched also. Andy is right linked lists are eficient in dynamic manipulation like insertion and deletion, but in your original post problem was with too much searching time and thats where linked lists are inefficient.


indexing may be option, but memory overhead and index maintanence overhead is there. if you can afford it you can go for it. other wise hashing is an good option.


abhishek