Breaking News: Grepper is joining You.com. Read the official announcement!

merging two unsorted arrays in sorted order

Add Answer

Wicked Willet answered on September 22, 2021 Popularity 1/10 Helpfulness 1/10

answer merging two unsorted arrays in sorted order

related merge two sorted array

related merge two unsorted array in sorted order

merging two unsorted arrays in sorted order

Comment

c++ program to merge two unsorted arrays and the output should be in the form of sorted manner

Popularity 1/10 Helpfulness 1/10 Language whatever

Source: Grepper

Tags: arrays whatever

Link to this answer
Share Copy Link

Contributed on Sep 22 2021

Wicked Willet

0 Answers Avg Quality 2/10

Closely Related Answers

merge two sorted array

Comment

// Create a function that when given 2 sorted arrays, it returns
// a new sorted array that contains both elements of input arrays
// --- Examples
// merge([1,3], [2,4]) === [1,2,3,4]
// merge([1,5], [4,6,7]) === [1,4,5,6,7]
// merge([4,6,7], [1,5]) === [1,4,5,6,7]

function merge(sortedArr1, sortedArr2) {
  let p1 = 0;
  let p2 = 0;
  let res = [];
  while (p1 < sortedArr1.length && p2 < sortedArr2.length) {
    if (sortedArr1[p1] < sortedArr2[p2]) {
      res.push(sortedArr1[p1]);
      p1++;
    } else {
      res.push(sortedArr2[p2]);
      p2++;
    }
  }

  while (p1 < sortedArr1.length) {
    res.push(sortedArr1[p1]);
    p1++;
  }
  while (p2 < sortedArr2.length) {
    res.push(sortedArr2[p2]);
    p2++;
  }
  return res;
}

Popularity 10/10 Helpfulness 2/10 Language javascript

Source: Grepper

Tags: javascript j

Link to this answer
Share Copy Link

Contributed on Nov 26 2022

Mohammad alshraideh

0 Answers Avg Quality 2/10

merge two unsorted array in sorted order

Comment

// CPP program to merge two unsorted lists 
// in sorted order
#include <bits/stdc++.h>

using namespace std;
 
// Function to merge array in sorted order

void sortedMerge(int a[], int b[], int res[], 

                                int n, int m)
{

    // Concatenate two arrays

    int i = 0, j = 0, k = 0;

    while (i < n) {

        res[k] = a[i];

        i += 1;

        k += 1;

    }

    while (j < m) {

        res[k] = b[j];

        j += 1;

        k += 1;

    }
 

    // sorting the res array

    sort(res, res + n + m);
}
 
// Driver code

int main()
{

    int a[] = { 10, 5, 15 };

    int b[] = { 20, 3, 2, 12 };

    int n = sizeof(a) / sizeof(a[0]);

    int m = sizeof(b) / sizeof(b[0]);
 

    // Final merge list

    int res[n + m];

    sortedMerge(a, b, res, n, m);
 

    cout << "Sorted merged list :";

    for (int i = 0; i < n + m; i++)

        cout << " " << res[i];

    cout << "n";
 

    return 0;
}

Popularity 7/10 Helpfulness 1/10 Language cpp

Source: www.geeksforgeeks.org

Tags: c++ merge

Link to this answer
Share Copy Link

Contributed on Aug 08 2022

2073 JAYDEEP KHOT

0 Answers Avg Quality 2/10

merging two unsorted arrays in sorted order

Contents

More Related Answers

merging two unsorted arrays in sorted order

Closely Related Answers

merge two sorted array

merge two unsorted array in sorted order

Grepper

Documentation

Social

Legal

Contact

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