Apparently no one appreciates my quicksort implementation (and introsort, which has an upper bound complexity of O(n log n) and average complexity of O(n log n) because it switches from quicksort to heapsort based on a certain threshold):
http://forums.graalonline.com/forums...ad.php?t=81279
Or maybe I just scared off everyone with the first function in that thread for efficient string searching.