Method merge

Sorting/Homework/mergeSort.cpp:3–35

class Solution {
public:
    vector<int> merge(vector<int> &A, vector<int>& B){
        int sizeA=A.size();
        int sizeB=B.size();
        int i=0;
        int j=0;
        vector<int> ans;
        
        //Compare and fill ans vector
        while (i<sizeA && j<sizeB){
            if(A[i]<B[j]){
                ans.push_back(A[i]);
                i=i+1;
            } else{
                ans.push_back(B[j]);
                j=j+1;
            }
        }
        
        //Add remaining elements from A
        while(i<sizeA){
            ans.push_back(A[i]);
            i=i+1;
        }
        
        //Add remaining elements from B
        while(j<sizeB){
            ans.push_back(B[j]);
            j=j+1;
        }
        
        return ans;
    
    }
    
    vector<int> mergeSort(vector<int>& nums,int start, int end) {
        //Base Case