Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include<conio.h>
- #include<time.h>
- #include<stdlib.h>
- int main(){
- int polje[25],i,k,j,pom,max,npolje[25]={0},brojac=0;
- time_t t;
- srand((unsigned)time(NULL));
- printf("Ne sortirano polje\n");
- k=0;
- for(i=0;i<25;i++){
- polje[i]=10+rand()%(99-10+1);
- printf("%d ",polje[i]);
- if((polje[i]%2)==0){
- npolje[k]=polje[i];
- k++;
- }
- }
- printf("\nSortirano novo [samo parni] polje\n");
- for(i=0;i<k;i++)
- {
- max=i;
- for(j=i+1;j<25;j++){
- if(npolje[j]>npolje[max])
- max=j;
- }
- pom=npolje[i];
- npolje[i]=npolje[max];
- npolje[max]=pom;
- printf(" %d",npolje[i]);
- }
- printf("\nSortirano staro polje:\n");
- for(i=0;i<25;i++)
- {
- max=i;
- for(j=i+1;j<25;j++){
- if(polje[j]>polje[max])
- max=j;
- }
- pom=polje[i];
- polje[i]=polje[max];
- polje[max]=pom;
- printf(" %d",polje[i]);
- }
- getche();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement