The concept of in-place quicksort binary tree has great theoretical and practical reference value to the research and improvement of sorting algorithm.
Hillis then reran the experiment but with this important difference: He allowed the sorting test itself to mutate while the evolving sorter tried to solve it.