poj 2299 Ultra-QuickSort

Description In this problem, you have to analyze a particular sorting algorithm. The algorithm processes a sequence of n distinct integers by swapping two adjacent sequence elements until the sequence

>>阅读原文<<