Advertisement
Guest User

C

a guest
Jan 28th, 2015
181
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.66 KB | None | 0 0
  1. #include <stdlib.h>
  2. #include <stdio.h>
  3.  
  4. void unione(int A[], int na, int B[], int nb, int C[], int nc){
  5. int i, j;
  6. nc=0;
  7. for (i=0; i<na; i++)
  8. C[(nc)++]=A[i];
  9. for (i=0; i<nb; i++)
  10. C[(nc)++]=B[i];
  11. }
  12.  
  13. int SelectionSort(int a[], int N) {
  14. int i, j, min;
  15. int t;
  16. for (i=0; i < N-1; i++) {
  17. min = i;
  18. for (j= i+1; j < N; j++) {
  19. if (a[j] < a[min]) {
  20. min = j;
  21. }
  22. }
  23. t = a[min];
  24. a[min] = a[i];
  25. a[i] = t;
  26. }
  27. }
  28.  
  29. int main()
  30. {
  31. int A[10]={1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
  32. int B[11]={20, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10};
  33. int C[21];
  34. unione(A, 10, B, 11, C, 21);
  35. SelectionSort(C, 21);
  36. int i ;
  37. for( i = 0; i<21; i++)
  38. printf ("%d",C[i]);
  39. system("pause");
  40. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement