Re: CListCtrl, hide and edit

Looks like n**2 bubble sort. Works OK for small n, but for large n, it is
a killer. I
tend to just use qsort because it is n*log(n)

I once had an app which required sorting a doubly-linked list. The
problem was that old
data files were unsorted. So what I did was for any version of the file <
k (the version
k was the one that now required the list be maintained in ascending order,
for realtime
performance), I would run across the list once; if it was in order, I left
it alone.

If it was not in order, I allocated a vector of count-of-list-elements
pointers, put a
pointer to every list element in it, qsorted the array, then ran through
the array,
linking up the elements in sorted order. This whole operation took under
5 seconds on an
80286 (read: small memory). The problem was that for very large arrays,
we discovered in
beta testing, when I did the malloc(n * sizeof(void *)), I got back NULL
because there
wasn't enough space to allocate the side vector. In that case, I popped
up a status
display saying "Updating older format file to new format, please be
patient, this may take
several minutes" and proceeded to do a bubble sort, which could take up to
three minutes.
Of course, once we wrote the file back out in the new format, we knew it
was in order and
didn't have to go through this again.

But it really pointed out how n**2 and n*log2(n) differ in performance.
joe