Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include<stdlib.h>
- #define MAX_N 10
- int tomb[MAX_N+1];
- int i,j,n,munka;
- main()
- {
- printf("n=");
- scanf("%d",&n);
- for (i=1;i<=n;i++)
- {
- printf("tomb[%d]:",i);
- scanf("%d",&tomb[i]);
- }
- for(i=1;i<=n-1;i++)
- for(j=1;j<=n-i;j++)
- if(tomb[j]>tomb[j+1])
- {
- munka=tomb[j];
- tomb[j]=tomb[j+1];
- tomb[j+1]=munka;
- }
- puts("A rendezett tomb: ");
- for(i=1;i<=n;i++)
- printf("tomb[%d]=%d\n",i,tomb[i]);
- system("pause");
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement