Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- void Sort(int *ptrA, int &lengthA, int *ptrB, int &lengthB) {
- int length = lengthA + lengthB;
- int newArray[100];
- newArray[length];
- int i = 0;
- while (i < lengthA) {
- newArray[i] = ptrA[i];
- i++;
- }
- int j = 0;
- while (i < length) {
- newArray[i] = ptrB[j];
- j++;
- i++;
- }
- for (size_t m = 0; m < length-1; m++)
- {
- for (size_t k = 0; k < length-1; k++)
- {
- if (newArray[k] > newArray[k + 1]) {
- int temp = newArray[k];
- newArray[k] = newArray[k + 1];
- newArray[k + 1] = temp;
- }
- }
- }
- for (size_t m = 0; m < length; m++) {
- std::cout << newArray[m]<<" ";
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment