Abhishek (Copy to list) I don't think anyone has asked WHY you particularly need this to be O(logN)? If there are only 32k numbers then the time taken to find the missing ones will be pretty small; it will only add up if you are doing this search many times, and it becomes a major part of your system load. Or is a question for some other purpose (eg an examination, a job interview, a certification)? I think Chris Taylor's message may be driving at the same point. Mark Farnham's answer already gives you the O(N*logN) sorting option... Regards Nigel -- //www.freelists.org/webpage/oracle-l