Hi, is there an easy/fast method to sort a chooser list (alas listbrowser has) alphabetically?
Or do I have to use AVL_AddNode() or some bubble_sort merge_sort of my "own" to chooser nodes/names.
On AMINET there are some c sources of sorting methods (http://aminet.net/dev/src/sort.lha)
THX
Tue, 2015-08-11 23:29
#1
How to sort a chooser list?
'while()'
loop moves forward through the list, whereas the inner'while()'
loop moves backwards through the list for as long as necessary. In worst case (full inverse) it will go backwards until it hits the limit of the list'(Prev == NULL)'
, in which case you better simply inverse the list: