Suggestions for benchmarks for work on TList.Sorting.


I could not find a better place for these suggestions, so I will
put them here. Please excuse me if the topics have already
been addressed.

I suggest that the benchmarks for sorts that are intended for
use in the VCL should include
(1) having the start data already in sorted order and
(2) having the start data already the reverse of sorted order.

Both of these situations are common when handling
data for display.

A third kind of start data that I would consider using is
(3) Having unsorted data appended to the end of a sorted list.

The TList.Sort programmer should be aware that some lists
may contain nil items that usually need to be pushed to end
of the list.

--JohnH


.

Relevant Pages

  • Re: How many bytes per Italian character?
    ... Write the code to insert a new element in sorted order" and of 27 interviewees, 26 failed to do it, and the only one who got it right was a PhD candidate, and she struggled to get it. ... I can do it with both LRU optimization for lookup and sublinear insert performance for large lists without thinking too hard about it. ... If with list we mean array, I could do a kind of binary search to find the place of insertion, and then insert. ... If Dr. Newcomer's caching succeeds then he doesn't have to visit all previous K-1 elements. ...
    (microsoft.public.vc.mfc)
  • Re: Suggestions for benchmarks for work on TList.Sorting.
    ... > I suggest that the benchmarks for sorts that are intended for ... > having the start data already the reverse of sorted order. ... > The TList.Sort programmer should be aware that some lists ... TList.Sort shouldn't be dereferencing the pointers anyway as they may ...
    (borland.public.delphi.language.basm)
  • Re: parsing directory
    ... the fully qualified names of all .png files in sorted order,ie in ... files declares functions to browse a directory and lists its content and is, if I recall correctly, also mentioned in the K&R book. ... If you have the list of file, you only need to do a string comparison on the file extension. ...
    (comp.lang.c)
  • Re: Code Review (Skip List)
    ... > access is much slower than hash tables, and any hash table can be ... You're missing that for some applications is useful to be able to ... traverse a list in sorted order and modify the list, ... lists can be used for the same applications, ...
    (comp.lang.c)
  • Re: Relative URLs
    ... You'll have to excuse me as ... customized lists, doc libraries, etc. ... to provide lists of short cuts, nav menus, etc... ... site is created, I need relative links. ...
    (microsoft.public.sharepoint.windowsservices)