11
:
: .
{i} (i=[1;n]), . {i} , i < j Xi < Xj (i, j=[1;n]) ( ) Xi > Xj ( ). {i} , .
( )
, i- i i i+1 (i=[1;n-1]). Ai i Ai+1 . , . () {i}.
( (n*n-n)/2), , .
, i- (i=[1;n-1]) {Aj} (j=[i+1;n]) k Ak, ( ) ( ) Ai ( k i ). , (, ) . , (i+1) - {X}, i- , 1. n*n/2.
: () , . , i- (i=[2;n]) i j (j=[1;i-1]), i < j ( ) i > j ( ), j i-1 , - i j ( Xi "" {} j ).
ʳ n*n/4 . .
1.
2. : , ,
3. {i}n : , .
|
|
|
- :
{i}n [K1;K2] [10...20].
{Ai}n .
(, , 䒺, , ..).
{i}n (i=[1;n]), [K1;K2], , .
// ( )
#include <iostream.h>
#include <conio.h>
void Sort (int A[], int n)
{ int i, found;
do {
found = 0;
for (i = 0; i <= n-1; i++)
if (A[i] > A[i+1]){
int cc= A[i]; A[i] = A[i+1]; A[i+1] = cc
found++;
}
} while (found!=0);
}
void main (void)
{ int i, Size, K1, K2;
clrscr ();
cout << endl << " K1 K2 : ";
cin >> Size >> K1 >> K2;
int Array[Size];
randomize ();
for (i = 1; i <= Size; i++) Array [i] = random (K2-K1+1) + K1;
cout << endl << " :" << endl;
for (i = 1; i <= Size; i++) cout << Array[i];
Sort (Array, Size);
cout << endl << " :" << endl;
for (i = 1; i <= Size; i++) cout << Array[i];
}
#include <iostream.h>
#include <conio.h>
void Sort (int in[]? Int n)
{
for (int i=0; i < n-1; i++) {
for(int j=i+1,k=s; j < n; j++)
if (in[j]<in[k]) k=j;
int c=in[k]; in[k]=in[i];in[i]=c;
}
}
void main (void)
{ int i, Size, K1, K2;
clrscr ();
cout << endl << " K1 K2 : ";
cin >> Size >> K1 >> K2;
int Array[Size];
randomize ();
for (i = 1; i <= Size; i++) Array [i] = random (K2-K1+1) + K1;
cout << endl << " :" << endl;
for (i = 1; i <= Size; i++) cout << Array[i];
Sort (Array, Size);
cout << endl << " :" << endl;
for (i = 1; i <= Size; i++) cout << Array[i];
#include <iostream.h>
#include <conio.h>
void Sort (int in[]? Int n)
{ for (int i=1; i <= n; i++) {
int v=in[i];
for (int k=0; k<1j <=1; kj++)
if (in[k] < v) break;
for(int j=i-1;j>=k;j--)
int[j+1]=in[j];
in[k]=v;
}}
void main (void)
{ int i, Size, K1, K2;
clrscr ();
cout << endl << " K1 K2 : ";
cin >> Size >> K1 >> K2;
int Array[Size];
randomize ();
for (i = 1; i <= Size; i++) Array [i] = random (K2-K1+1) + K1;
cout << endl << " :" << endl;
for (i = 1; i <= Size; i++) cout << Array[i];
Sort (Array, Size);
cout << endl << " :" << endl;
|
|
|
for (i = 1; i <= Size; i++) cout << Array[i];
}
i
1. .
2. ?
3. : , .
4. .
5. .
