Merging and sorting vectors.

[SUP3RAB3]

Well i have an assignment for class and im having a little trouble understanding how to code this. I have 2 vectors (A & B), the goal is to 1) merge the vectors into a separate vector in the pattern of a[1], b[1], a[2], b[2], etc including duplicates if they were to occur. 2) Take those same vectors ( A & B) and merge and sort them in numerical order( lowest to biggest) then in the main function take the results and display them. Can someone set me off with some code to help me through this. Please and thank you.

[SUP3RAB3]

Bump?

[guestgulkan]

What have you got so far??

[Need4Sleep]

We need something to work off, attempt the assignment first.

[SUP3RAB3]

This is all i have done so far.

#include <iostream>
#include <vector>

using namespace std;

int vector<int> append(vector<int> a, vector<int> b)
{
    int n = a.size();
    int m = b.size();
    vector<int> c(n + m);
    int i;

    for (i = 0; i < n; i++)
        c[i] = a[i];

    for (i = 0; i < m; i++)
        c[n + i] = b[i];

    return c;
}

int vector<int> merge(vector<int> a, vector<int> b)
{
	while (counter < a.size && b.size)

}

int vector<int> merge_sorted(vector<int> a, vector<int> b)
{

}

int main()
{
    int input;

	cout<< "Input numbers for vector A. Terminate with -1"
	while (cin >> input)
		a.push_back(input)
	count<< "Input numbers for vector B. Terminate with -1"
	while (cin >> input);
		b.push_back(input);
	cout<< "Vector A is" << << "\n";
	cout<< "vector B is" << << "\n";
}

[SUP3RAB3]

Bump? Sorry but i really need help on this.

[ui uiho]

#include <iostream>
#include <vector>
#include <algorithm>


int main(){
    std::vector<int> myints;
    std::vector<int> mynewints;
    
    for(int i = 0; i <= 10; i++){
        myints.push_back(i);
    }
    
    copy(myints.begin(), myints.end(), mynewints); 
    
    for(int i = 0; i <= 10; i++){
        std::cout << mynewints[i]; 
    }
    return 0; 
} 

the template is

template<class InputIterator, class OutputIterator>
  OutputIterator copy ( InputIterator first, InputIterator last, OutputIterator result )
{
  while (first!=last) *result++ = *first++;
  return result;
}

[Stewbond]

Your append function could be reduced to this: It will append b to a.
a.insert(a.end(), b.begin(), b.end());

Then to sort the array, you could use an STL algorithm:
std::sort( a.begin(), a.end() );

Tada!

Here's a complete example:

#include <vector>    // std::vector<T>
#include <algorithm> // std::sort()
#include <iostream>  // std::cout

int main()
{
    std::vector<int> a, b;
    
    for (int i = 0; i < 10; ++i)
        a.push_back(i),                      // 0 1 2 3 4 5 6 7 8 9
        b.push_back(i+1);                    // 1 2 3 4 5 6 7 8 9 10

    a.insert( a.end(), b.begin(), b.end() ); // 0 1 2 3 4 5 6 7 8 9  1 2 3 4 5 6 7 8 9 10

    std::sort( a.begin(), a.end() );         // 0 1 1 2 2 3 3 4 4 5  5 6 6 7 7 8 8 9 9 10

    for (std::vector<int>::iterator it = a.begin(); it != a.end(); ++it)
        std::cout << *it << " ";

    return 0;
}

[ne555]

int vector<int> merge(vector<int> a, vector<int> b)
{
	while (counter < a.size && b.size)

}

Nothing then...
Suppose that the two vectors have the same size.

for(size_t K=0; K<size; ++K){
  c.push_back( a[K] );
  c.push_back( b[K] );
}

[ui uiho]

while (counter < a.size && b.size)
size is a function and therefore needs () behind it.