mauro russo wrote: > does the method TList.IndexOf run in logarithmic time or in linear time? > [in Delphi 7 enivronment]
It must run in linear time. TList has no way of knowing how to do anything faster. The only way it could run a binary search is if IndexOf received a Compare function the way the Sort function does. Otherwise, IndexOf can't compare in any way but pointer equality. -- Rob
