Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <stdlib.h>
- #include "time.h"
- void inc10(int *nPtr)
- {
- *nPtr=*nPtr+10;
- }
- int ascending(int a, int b)
- {
- return a>b;
- }
- int descending(int a, int b)
- {
- return a<b;
- }
- void swap_elements(int* a, int* b)
- {
- int temp=*a;
- *a=*b;
- *b=temp;
- }
- void sort(int* a,int n,int (*compare)(int,int))
- {
- int i,j;
- for(i=0;i<n-1;i++)
- {
- for(j=i+1;j<n;j++)
- {
- if((*compare)(a[i],a[j]) )
- {
- swap_elements(&a[i],&a[j]);
- }
- }
- }
- }
- void popuniNiz( int * niz, int n)
- {
- int i;
- for(i=0;i<n;i++)
- niz[i]=rand()%100;
- }
- int main()
- {
- srand(time(0));
- int a=10;
- int* aPtr;
- aPtr=&a;
- printf("aPtr=%p\n &a=%p\n",aPtr,&a);
- int b;
- b=*aPtr;
- printf("b=%d\n",b);
- printf("%p %p\n",*&aPtr,&*aPtr);
- *aPtr=100;
- printf("a=%d b=%d\n",a,b);
- int x=13;
- inc10(&x);
- printf("%d\n",x);
- int* tPtr=NULL;
- /*
- int *const xPtr1=&x;
- xPtr1=&a; //mijenja vrijednost pokazivacu koji je konstanta
- *xPtr1=50;
- const int* xPtr2=&x;
- xPtr2=&a;
- *xPtr2=80; //mijenja vrijednost konstantne promjenjive
- const int *const xPtr3=&x;
- xPtr3=&a;
- *xPtr3=70;
- */
- void (*fPtr) (int*);
- fPtr=inc10;
- (*fPtr)(&x);
- printf("x=%d\n",x);
- int niz1[5]={23,45,3,65,11};
- int* nPtr=&niz1[0];
- printf("%p %p\n",nPtr,niz1);
- int i;
- for(i=0;i<5;i++)
- {
- printf("%4d",nPtr[i]);
- }
- printf("\n");
- printf("%p\n",nPtr+2);
- sort(niz1,5,ascending);
- for(i=0;i<5;i++)
- {
- printf("%4d",*(nPtr+i));
- }
- printf("\n");
- int n;
- scanf("%d",&n);
- int* niz2=malloc(n*sizeof(int)); //aloricanje memorije na heap-u
- popuniNiz(niz2,n);
- for(i=0;i<n;i++)
- {
- printf("%4d",niz2[i]);
- }
- printf("\n");
- int r,c;
- scanf("%d",&r);
- scanf("%d",&c);
- int** mat=malloc(r*sizeof(int*));
- for (i=0;i<r;i++)
- {
- mat[i]=malloc(c*sizeof(int));
- popuniNiz(mat[i],c);
- }
- int j;
- for (i=0;i<r;i++)
- {
- for (j=0;j<c;j++)
- {
- printf("%4d",*(*(mat+i)+j));
- }
- printf("\n");
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement