Answer Posted / naman patidar

above problem can be solved using marge sort technique.
here i am giving a solution in java.

public class MargeSort {
public static void main(String[] args) {
int a[] = { 2, 5, 7, 9, 10, 15 };
int b[] = { 1, 3, 4, 5, 12, 14 };
int c[] = new int[a.length + b.length];
int aIndex = 0, bIndex = 0, cIndex = 0;

while (aIndex < a.length && bIndex < b.length) {
if (a[aIndex] < b[bIndex]) {
c[cIndex++] = a[aIndex++];
} else {
c[cIndex++] = b[bIndex++];
}
}
if (aIndex < a.length) {
while (aIndex < a.length) {
c[cIndex++] = a[aIndex++];
}
}
if (bIndex < b.length) {
while (bIndex < b.length) {
c[cIndex++] = b[bIndex++];
}
}
for (int i = 0; i < c.length; i++) {
System.out.println(c[i]);
}
}
}

What is c++ course?

981

---

What is the best c++ compiler for windows 10?

984

---

Why is the function main() special?

1039

---

Give example of a pure virtual function in c++?

1082

---

what is data abstraction in C++?

1025

---

what is pre-processor in C++?

1084

---

Explain deep copy and a shallow copy?

986

---

What is the size of integer variable?

1007

---

Which software is best for c++ programming?

993

---

What is code reusability in c++?

1180

---

What do you mean by enumerated data type?

1000

---

Is java as fast as c++?

1041

---

What is the full form of india?

1027

---

Are vectors passed by reference c++?

934

---

Explain one-definition rule (odr).

1063

---