Skip to content
Open
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
77 changes: 77 additions & 0 deletions Cpp_question.cpp
Original file line number Diff line number Diff line change
@@ -0,0 +1,77 @@
Implementation:

// CPP program to merge two unsorted lists
// in sorted order
#include <bits/stdc++.h>

using namespace std;

// Function to merge array in sorted order

void sortedMerge(int a[], int b[], int res[],

int n, int m)
{

// Concatenate two arrays

int i = 0, j = 0, k = 0;

while (i < n) {

res[k] = a[i];

i += 1;

k += 1;

}

while (j < m) {

res[k] = b[j];

j += 1;

k += 1;

}


// sorting the res array

sort(res, res + n + m);
}

// Driver code

int main()
{

int a[] = { 10, 5, 15 };

int b[] = { 20, 3, 2, 12 };

int n = sizeof(a) / sizeof(a[0]);

int m = sizeof(b) / sizeof(b[0]);


// Final merge list

int res[n + m];

sortedMerge(a, b, res, n, m);


cout << "Sorted merged list :";

for (int i = 0; i < n + m; i++)

cout << " " << res[i];

cout << "n";


return 0;
}