Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdlib.h>
- #include <stdio.h>
- void unione(int A[], int na, int B[], int nb, int C[], int nc){
- int i, j;
- nc=0;
- for (i=0; i<na; i++)
- C[(nc)++]=A[i];
- for (i=0; i<nb; i++)
- C[(nc)++]=B[i];
- }
- int SelectionSort(int a[], int N) {
- int i, j, min;
- int t;
- for (i=0; i < N-1; i++) {
- min = i;
- for (j= i+1; j < N; j++) {
- if (a[j] < a[min]) {
- min = j;
- }
- }
- t = a[min];
- a[min] = a[i];
- a[i] = t;
- }
- }
- int main()
- {
- int A[10]={1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
- int B[11]={20, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10};
- int C[21];
- unione(A, 10, B, 11, C, 21);
- SelectionSort(C, 21);
- int i ;
- for( i = 0; i<21; i++)
- printf ("%d",C[i]);
- system("pause");
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement