i solved the problem, and now i see its easy program actualy
here it is:
Code:
#include <stdio.h>
#include <iostream.h>
#define max 31
main()
{
int n[max],brpoz=0,brneg,element,i,j,broj,save,t;
do{
printf("UNESI BROJ ELEMENATA NIZA: \n");
scanf("%d",&broj);
if(broj<1||broj>max) printf("GRESKA!!\n");
}while(broj<1||broj>max);
brneg=broj-1;
////////////////////////////////////////////////////////////////////////////////////
for(i=0;i<broj;i++)
{
do{
printf("%d.CLAN NIZA: ",i+1);
scanf("%d",&element);
if(element<-1000000||element>1000000) printf("GRESKA!!\n");
}while(element<-1000000||element>1000000);
if(element>-1)
{
n[brpoz]=element;
brpoz++;
}
else if(element<0)
{
n[brneg]=element;
brneg--;
}
}
////////////////////////////////////////////////////////////////////////////////////
brpoz++;
for(i=brneg+1,j=broj-1;i<=(brneg+broj)/2;i++,j--)
{
t=n[i];
n[i]=n[j];
n[j]=t;
}
for(i=0;i<broj;i++)
{
printf("\n%d.CLAN: %d",i+1,n[i]);
}
printf("\n\n");
system("pause");
}
sorry, i had no time to translate all the texts from serbian into english, but anyway, you'll get the meaning of the code