Heap sort that uses in engine doesn't very fast. Even Shell sort is faster than heap sort. May be engine must use another sort method, like quick sort or linear sort?
That,s right, it is not the fasted method. I implemented heapsort because I never did that before and wanted to try it out. But if you like, add another sorting method to the array. And maybe post it here, eventually together with some benchmarking results? Would be interesting too
