Advertisement
Guest User

Untitled

a guest
May 29th, 2015
212
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.05 KB | None | 0 0
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3.  
  4.  
  5. void sortowanie (int *tab, int x)
  6. {
  7. int a, b, i, j;
  8.  
  9. for (i=0; i<x; i++)
  10. {
  11. a = tab[i];
  12.  
  13. for (j=i+1; j<x+1; j++)
  14. {
  15. if (tab[j]<a)
  16. {
  17. a = tab[j];
  18. }
  19. b = tab[j];
  20. tab[j] = tab[i];
  21. tab[i] = b;
  22. }
  23.  
  24. printf ("%d ", tab[i]);
  25. }
  26.  
  27. };
  28.  
  29. void scanlanie (int tab, int x)
  30. {
  31.  
  32.  
  33.  
  34. }
  35.  
  36.  
  37.  
  38. int main ()
  39. {
  40.  
  41. int n, i;
  42.  
  43. printf ("Podaj ile elementow maja zawierac tablice: ");
  44. scanf ("%d", n);
  45.  
  46. int *tab1 = (int*)malloc(sizeof(int));
  47. int *tab2 = (int*)malloc(sizeof(int));
  48. int *tab = (int*)malloc(sizeof(int));
  49.  
  50. printf ("\n\nPierwsza tablica bez sortowania: \n");
  51. for (i=0; i<n; i++)
  52. {
  53. tab1[i]=rand()%100;
  54. printf ("%d ", tab[i]);
  55. }
  56. printf ("\n\nDruga tablica bez sortowania: \n");
  57. for (i=0; i<n; i++)
  58. {
  59. tab2[i]=rand()%100;
  60. printf ("%d ", tab[i]);
  61. }
  62.  
  63. printf ("\n\nPierwsza tablica posortowana: \n");
  64. sortowanie (*tab1, n);
  65.  
  66. printf ("\n\nDruga tablica posortowana: \n");
  67. sortowanie (*tab2, n);
  68.  
  69.  
  70.  
  71.  
  72.  
  73. return 0;
  74. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement