1 设数组为 A[n] int max = A[0]; for (int i = 1; i < n; ++ i) { if (A[i] > max) { max = A[i]; } } Console.WriteLine(max); 2 int i, j; int key; for ( i = 1; i < n; i ++ ) { j = i; key = A[i]; while ( j > 0 && A[j - 1] > key ) { A[j] = A[j - 1]; j --; } // end while A[j] = key; }// end for i for (i = 0; i < n; ++ i) { Console.WriteLine(A[i]); }
int max = A[0];
for (int i = 1; i < n; ++ i)
{
if (A[i] > max)
{
max = A[i];
}
}
Console.WriteLine(max);
2 int i, j;
int key; for ( i = 1; i < n; i ++ )
{
j = i;
key = A[i];
while ( j > 0 && A[j - 1] > key )
{
A[j] = A[j - 1];
j --;
} // end while
A[j] = key;
}// end for i
for (i = 0; i < n; ++ i)
{
Console.WriteLine(A[i]);
}