Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- int main()
- {
- int *x, *poc, n, *kraj, min, max, pom;
- do
- {
- printf("Unesite n: ");
- scanf("%d", &n);
- }while(n < 1);
- x = (int*) malloc (n * sizeof(int));
- for(poc = x ; poc < x + n ; poc++) *poc = 0;
- printf("UNOS NIZA\n");
- for(poc = x ; poc < x + n ; poc++)
- {
- printf("X[%d] = ", poc - x);
- scanf("%d", poc);
- }
- min = max = *x;
- for(poc = x + 1 ; poc < x + n ; poc++)
- {
- if(*poc < min) min = *poc;
- if(*poc > max) max = *poc;
- }
- poc = x;
- kraj = x + n - 1;
- while(poc <= kraj)
- {
- pom = *poc;
- *poc = *kraj;
- *kraj = pom;
- poc++, kraj--;
- }
- printf("Novi niz X: ");
- for(poc = x ; poc < x + n ; poc++)
- {
- printf("%d ", *poc);
- }
- free(x);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement