c++ merging algorithm

Borca Tudor answered on May 20, 2022 Popularity 9/10 Helpfulness 1/10

answer c++ merging algorithm

c++ merging algorithm

Comment

int n,a[100000], m , b[100000], p, c[200000];

//citire a[] cu n elemente
//citire b[] cu m elemente

int i = 0 , j = 0;
p = 0;
while(i < n && j < m)
    if(a[i] < b[j])
        c[p ++] = a[i ++];
    else
        c[p ++] = b[j ++];
while(i < n)
    c[p ++] = a[i ++];
while(j < m)
    c[p ++] = b[j ++];

Popularity 9/10 Helpfulness 1/10 Language cpp

Source: www.pbinfo.ro

Tags: algorithm c++ merge vector

Link to this answer
Share Copy Link

Contributed on May 20 2022

Borca Tudor

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

c++ merging algorithm

Contents

More Related Answers

c++ merging algorithm

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.