belongs to collection: C language array programs with an examples
#include <stdio.h> #define MAX_SIZE 100 //Maximum size of the array int main() { int arr1[MAX_SIZE], arr2[MAX_SIZE], mergeArray[MAX_SIZE]; int size1, size2, mergeSize; int index1, index2, mergeIndex; int i; //Reading size of the array printf("Enter the size of 1st array : "); scanf("%d", &size1); //Reading elements in the array printf("Enter elements in 1st array : "); for(i=0; i<size1; i++) { scanf("%d", &arr1[i]); } //Reading elements in the array printf("\nEnter the size of 2nd array : "); scanf("%d", &size2); //Reading elements in 2nd array printf("Enter elements in 2nd array : "); for(i=0; i<size2; i++) { scanf("%d", &arr2[i]); } mergeSize = size1 + size2; //Merging two array in ascending order index1 = 0; index2 = 0; for(mergeIndex=0; mergeIndex < mergeSize; mergeIndex++) { //If all elements of one array is merged to final array if(index1 >= size1 || index2 >= size2) { break; } if(arr1[index1] < arr2[index2]) { mergeArray[mergeIndex] = arr1[index1]; index1++; } else { mergeArray[mergeIndex] = arr2[index2]; index2++; } } //Merging the remaining elements of array while(index1 < size1) { mergeArray[mergeIndex] = arr1[index1]; mergeIndex++; index1++; } while(index2 < size2) { mergeArray[mergeIndex] = arr2[index2]; mergeIndex++; index2++; } //Print merged array printf("\nArray merged in ascending order : "); for(i=0; i<mergeSize; i++) { printf("%d\t", mergeArray[i]); } return 0; }
Enter the size of 1st array : 5
Enter elements in 1st array : 1
3
6
9
15
Enter the size of 2nd array : 4
Enter elements in 2nd array : 2
5
8
Array merged in ascending order : 1 2 3 5 6 8 9 15 15
total answers (1)
start bookmarking useful questions and collections and save it into your own study-lists, login now to start creating your own collections.
Result:
Enter the size of 1st array : 5
Enter elements in 1st array : 1
3
6
9
15
Enter the size of 2nd array : 4
Enter elements in 2nd array : 2
5
8
15
Array merged in ascending order : 1 2 3 5 6 8 9 15 15
need an explanation for this answer? contact us directly to get an explanation for this answer