I don't think that an algorithm with O(n lg(n) lg(n)) is a quicksort in a strict sense.