-
-
Save tayadehritik/31ce8746bad388292e9bfe91ac5566d2 to your computer and use it in GitHub Desktop.
Merge
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include <iostream> | |
| using namespace std; | |
| int linMerge(int a[], int b[], int); | |
| int sorMerge(int a[], int b[], int); | |
| int main() | |
| { | |
| int ch, a[20], b[20], size; | |
| cout<<"enter size\n"; | |
| cin>>size; | |
| cout<<"enter first array\n"; | |
| for(int i=0;i<size;i++){ | |
| cin>>a[i]; | |
| } | |
| cout<<"enter second array"; | |
| for(int i=0;i<size;i++){ | |
| cin>>b[i]; | |
| } | |
| bool forCase = true; | |
| while(forCase==true){ | |
| cout<<"\n1.linMerge\n2.sorMerge\n3.exit"; | |
| cin>>ch; | |
| switch(ch){ | |
| case 1: linMerge(a, b, size); | |
| break; | |
| case 2: sorMerge(a, b, size); | |
| break; | |
| case 3: forCase=false; | |
| break; | |
| default: cout<<"enter a valid option"; | |
| } | |
| } | |
| return 0; | |
| } | |
| int linMerge(int a[], int b[], int size){ | |
| int be=0,ab[20]; | |
| for(int i=0;i<(size*2);i++){ | |
| if(i%2==0){ | |
| ab[i] = a[be]; | |
| } | |
| else{ | |
| ab[i] = b[be]; | |
| be++; | |
| } | |
| } | |
| for(int i=0;i<(size*2);i++){ | |
| cout<<ab[i]<<"\n"; | |
| } | |
| return 0; | |
| } | |
| int sorMerge(int a[], int b[], int size){ | |
| int be=0,ab[20]; | |
| for(int i=0;i<(size*2);i++){ | |
| if(i%2==0){ | |
| ab[i] = a[be]; | |
| } | |
| else{ | |
| ab[i] = b[be]; | |
| be++; | |
| } | |
| } | |
| int temp; | |
| for(int i=0;i<(size*2);i++){ | |
| for(int j=0;j<(size*2);j++){ | |
| if(ab[j]>ab[i]){ | |
| temp = ab[j]; | |
| ab[j] = ab[i]; | |
| ab[i] = temp; | |
| } | |
| } | |
| } | |
| for(int i=0;i<(size*2);i++){ | |
| cout<<ab[i]<<"\n"; | |
| } | |
| return 0; | |
| } |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment