>- Open Your Mind -<



Quoting from Brian Hawley's message (10-Jul-00 23:18:02).

b> I mentioned three methods.

b> Resorting the list after every insert:

b> Incremental insertion sort (linear search):

b> Making sure the input is sorted in the first place:

b> Does that help?

Yes and no: while what you wrote deals well with the task, I was looking for the speed 
of a native function (while inadvertently going off topic... :-)




Alessandro Pini ([EMAIL PROTECTED])

"Open the window, HAL." (-: Bowman :-)

Reply via email to