Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <stdlib.h>
- void sortowanie (int *tab, int x)
- {
- int a, b, i, j;
- for (i=0; i<x; i++)
- {
- a = tab[i];
- for (j=i+1; j<x+1; j++)
- {
- if (tab[j]<a)
- {
- a = tab[j];
- }
- b = tab[j];
- tab[j] = tab[i];
- tab[i] = b;
- }
- printf ("%d ", tab[i]);
- }
- };
- void scanlanie (int tab, int x)
- {
- }
- int main ()
- {
- int n, i;
- printf ("Podaj ile elementow maja zawierac tablice: ");
- scanf ("%d", n);
- int *tab1 = (int*)malloc(sizeof(int));
- int *tab2 = (int*)malloc(sizeof(int));
- int *tab = (int*)malloc(sizeof(int));
- printf ("\n\nPierwsza tablica bez sortowania: \n");
- for (i=0; i<n; i++)
- {
- tab1[i]=rand()%100;
- printf ("%d ", tab[i]);
- }
- printf ("\n\nDruga tablica bez sortowania: \n");
- for (i=0; i<n; i++)
- {
- tab2[i]=rand()%100;
- printf ("%d ", tab[i]);
- }
- printf ("\n\nPierwsza tablica posortowana: \n");
- sortowanie (*tab1, n);
- printf ("\n\nDruga tablica posortowana: \n");
- sortowanie (*tab2, n);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement