数据结构第01讲绪论C.pptVIP

* * * * * * * * * * * * * * * * * * * 例二 void select_sort( int a[ ], int n) { // 将a中整数序列重新排列成自小至大有序的整数序列 for ( i = 0; i n-1; ++i ) { j = i; for ( k = i+1; k n; ++k ) if (a[k] a[j] ) j = k; if ( j != i ) a[j] ←→ a[i] } } // select_sort 基本操作: 比较操作；时间复杂度: O(n2) ? Evaluation only. Created with Aspose.Slides for .NET 3.5 Client Profile 5.2.0.0. Copyright 2004-2011 Aspose Pty Ltd. 例三 ??? void bubble_sort(int a[ ], int n) { //将a中整数序列重新排列成自小至大有序的整数序列 for (i=n-1, change=TRUE; i1 change; --i) { change = FALSE; for (j=0; ji; ++j) if (a[j] a