Hello,

I have a Question - I couldn't solved it :(

We have an unordered List, I want to find the phone number of john and it's position in the table names.

NAME :
http://i47.tinypic.com/x572he.png

TELEPHONE:
http://i47.tinypic.com/dysidy.png

Any idea what to do?

There's isn't much of a sophisticated algorithm one can use against an unordered list. You just have to iterate through each of the list's elements until you find John. So for an unordered list, the algorithm is going to be O(n) no matter what. It's usually best to sort the list first (perhaps based on person's name) and then implement one of the many efficient algorithms on ordered lists. Sorting the list once makes subsequent searches much more efficient.

Regards
Joe / UNIXY

Honestly though if the list is only 1000 people long, no big deal. Just loop it getting name/phone number and checking if name is John.

Or have two arrays and use the indexes appropriately. Both work.