illustration.cpp

来自「排序算法的内部复杂度分析,有八个算法,有时间和空间的分析,比较完整」· C++ 代码 · 共 5 行

void illustration()
{
	printf("Illustration:\n\n");
	printf("From the statistics above ,the conclusion is that though the Quicksort is deemedas one of the most optimal algorithm in sorting .it isn't precise everywhere andeverytime,especially say, when the items which is to be sorted are few,say no more than 100.The reason is the expense comsumed in excursion by Quicksort may offset that of  superiority or be more than the expense by other one.Moreover,other algorithm can overwhelm the Quicksort if the table is more or less sorted\n\n-------------------------------------------------------------------------------\n----------------------------------THE END----------------------------------------------------------------------------------------------");
}