Orchid XP v7 <voi### [at] devnull> wrote:
> Well, if the array elements are quite large, a linked list could 
> arguably be faster. However, in that case you'd likely use an array of 
> pointers, and any advantage is gone.

  If you are using a linked list because of the advantages of linked lists,
then using an array to sort the list is useless overhead because linked
lists can be sorted in-place in O(n log n) time.

-- 
                                                          - Warp

Post a reply to this message