Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <stdlib.h>
- #include <time.h>
- int i ,j,N,i,k=0,p;
- char X;
- //definiowanie
- typedef struct Struktura {
- int i;
- char c;
- float f;
- }Struktura;
- void kasowanie(int N, int ** tab)
- {
- for (i = 0; i<N; i++)
- free(tab[i]);
- free(tab);
- }
- int zliczanie();
- int main(int argc, char *argv[])
- {
- srand( time( NULL ) );
- sortowanie();
- }
- int pobieranie()
- {
- FILE* fp = fopen("inlab01.txt", "r");
- if (fp == NULL)
- return -1;
- fscanf(fp, "%d %c", &N, &X);
- fclose(fp);
- return 0;
- }
- Struktura ** losowanie()
- {
- pobieranie();
- //alokacja
- Struktura** tab=(Struktura**) malloc(N*sizeof(Struktura*));
- for(i=1;i<=N;i++){
- tab[i]=(Struktura*) malloc(sizeof(Struktura));
- do{
- int p=(-1000 + rand() % 9000);
- }
- while(p!=(*tab[k]).i);
- {
- int p=(-1000 + rand() % 9000);
- k++;
- if(k==i)break;
- }
- (*tab[i]).i=p;
- (*tab[i]).c= 66+rand() % 22;
- (*tab[i]).f= 1000 + i;
- }
- return ** tab;
- }
- int sortowanie(int **tab, int n) {
- for (i = 1; i <= n - 1; i++)
- {
- int flag = 0;
- for (j = 1; j <= (n - i); j++)
- {
- if ((*tab[j]).c = (*tab[j+1]).i)
- {
- int tmp = (*tab[j+1]).i;
- (*tab[j+1]).i = (*tab[j]).i;
- (*tab[j]).i = tmp;
- flag = 1;
- }
- if (flag = 0)
- return(**tab);
- }
- return(**tab);
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement