摘要:
//insort function//插入法排序//n是元素个数template void insort ( Elem A[], int n ){ for ( int i = 1; i 0) && ( A[j] void selsort (Elem A[],int n){ for( int i = 0 ; i A[j] ) minIndex = j; } ... 阅读全文
摘要:
//insort function//插入法排序//n是元素个数template void insort ( Elem A[], int n ){ for ( int i = 1; i 0) && ( A[j] void selsort (Elem A[],int n){ for( int i = 0 ; i A[j] ) minIndex = j; } ... 阅读全文
|