of of the slice. The same process is then applied to the larger of the two slices. After a slice is sorted the next smallest slice of vec is sorted.</dd></dl>
<p>Example ignoring the interchange sort 4 3 7 9 1 2 i pivot lower upper 1 3 1 6 |2 1 7 9 3 4| 2 5 3 6 2 1|4 3 9 7] 3 8 5 6 2 1 4 3|7 9| 2 4 3 4 2 1|3 4|7 9 1 1 1 2 |1 2|3 4 7 9</p>
<p>The alogorithm of the flat quick sort is harder to follow than the more conventional flat quick sort; however, it saves system resoruces. Also on systems with limitatio