Re: bgt, sorting number array from least to gratest
I seem to remember writing a BGT implementation of Quicksort, but I do not remember why. If you take a CS class, Array sorting will get entire lessons. Bubble Sort, Insertion Sort (simplest imo but slow), merge sort, and Quicksort are some of the best known. Quicksort is quickest, but kinda complicated, so if I can find my implementation, I might just post it. (Or you could look up an example in C or something, and work out how to port it, but then you'd have to understand the way references work in the language of choice.).
-- Audiogames-reflector mailing list Audiogames-reflector@sabahattin-gucukoglu.com https://sabahattin-gucukoglu.com/cgi-bin/mailman/listinfo/audiogames-reflector
