Schwartzian Transformation

Assume you have a vector A and you going to sort it according to a function f(x). If you sort it naively, whenever you are going to compare two items, you call the function. Because the best sorting algorithm we know nowadays is \(O(n \log n)\), you call such function... [more]