#include<stdio.h>
int*merged(int[], int[], int, int);
void sort(int[], int);
int main() {
int size1;
printf("Enter list1: ");
scanf("%d", &size1);
int list1[size1];
for (int i = 0; i < size1; i++) {
scanf("%d", &list1[i]);
}
int size2;
printf("Enter list2: ");
scanf("%d", &size2);
int list2[size2];
for (int i = 0; i < size2; i++) {
scanf("%d", &list2[i]);
}
int*list3 = merged(list1, list2, size1, size2);
printf("The merged list is: ");
int size3 = size1 + size2;
for (int i = 0; i < size3; i++) {
printf("%d ", list3[i]);
}
printf("\n");
}
int*merged(int list1[], int list2[], int size1, int size2) {
int list3[size1 + size2];
for (int i = 0; i < size1; i++) {
list3[i] = list1[i];
}
int count = size1;
for (int i = 0; i < size2; i++) {
list3[count] = list2[i];
count++;
}
int size3 = size1 + size2;
sort (list3, size3);
int*list4;
for (int i = 0; i < size3; i++) {
list4[i] = list3[i];
}
return list3;
}
void sort(int list3[], int size3) {
for (int i = 0; i < size3; i++) {
int min = list3[i];
int min_index = i;
for (int j = i + 1; j < size3; j++) {
if (list3[j] < min) {
min = list3[j];
min_index = j;
}
}
if (min_index != i) {
list3[min_index] = list3[i];
list3[i] = min;
}
}
}
