In-place quicksort based on full binary tree
Fan Shi-ping · Journal of Chongqing University of Posts and Telecommunications · 2006
In-place quicksort based on full binary tree is introduced.The new algorithm has two main differences from classic quicksort.The first is that the pivot of the new algorithm is dynamic but the classic's is static in every partition.The second is that the new algorithm computes the scope and the pivot of the next partition,so it can avoid using recursive or using stack.The experiment certifies that the time property of the new algorithm is superior to that of the best in-place heapsort.The concept of in-place quicksort binary tree has great theoretical and practical reference value to the research and improvement of sorting algorithm.