You are on page 1of 2

()

1 ()

:
:
k n+1 for,
for.
, . * (n+1)
:
#include<stdio.h>
#define N 6
main()
{
int i,j,x,a,z;
int A[N]={1,2,3,4,5,8}
printf( z:\n);
scanf(%d,&z);
for(i=0;i<=N;i++)
x=A[i];
for(j=0;j<=N;j++)
a=x+A[j];
if(a==z)
printf( x y. \n);
else
printf( x y. \n);
}

:
printf( : \n);
scanf(%d,&n);
for(i=n;i>=0;i--)
if(crash==1)
orofos=A[i];
printf(
%d:,orofos);
:
InsertionSort
.. [] [1]<
[3]<[5] [0]<[2]<[4]
() ,
,
.