数据结构-1.pptVIP

例 x = 0; y = 0; for ( int k = 0; k n; k ++ ) x ++; for ( int i = 0; i n; i++ ) for ( int j = 0; j n; j++ ) y ++; T1(n) = O(1) T2(n) = O(n) T3(n) = O(n2) T(n) = T1(n)+T2(n)+T3(n) = O( max( 1, n, n2 ) ) = O(n2) for (i=1;i=n ;i++) for (j=1;j=n;j++) c[i][j]+= a[i][j]* b[i][j]; 例 T1(n) = O(n) T2(n) = O(n) T(n) = T1(n)*T2(n) = O( n*n ) = O(n2) 例：选择排序 void sele_sort(int A[ ],int n) { for (i=0;in-1;i++) { index=i; for (j=i+1;jn;j++) if (A[j]A[index]) index=j; if (index!=i) { temp=A[index]; A[index]=A[i];