list merge() function in C++ STL

The list::merge() is an inbuilt function in C++ STL which merges two sorted lists into one. The lists should be sorted in ascending order. If no comparator is passed in parameter, then it merges two sorted lists into a single sorted list. If a comparator is passed in the parameter, then it merges the list accordingly doing internal comparisons.

1. Syntax:

list1_name.merge(list2_name)

1. Parameters: The function accepts a single mandatory parameter list2_name which specifies the list to be merged into list1. Return value: The function does not returns anything Program below demonstrates the function: Program 1:

CPP

// program below demonstrates the
// merge function in c++
#include <bits/stdc++.h>
using namespace std;

int main()
{
    // declaring the lists
    // initially sorted
    list<int> list1 = { 10, 20, 30 };
    list<int> list2 = { 40, 50, 60 };

    // merge operation
    list2.merge(list1);

    cout << "List: ";

    for (auto it = list2.begin(); it != list2.end(); ++it)
        cout << *it << " ";

    return 0;
}

Output:

List:  10 20 30 40 50 60

Time complexity: O(n + m -1) where n is size of list1 and m is size of list 2

1. Syntax:

list1_name.merge(list2_name, comparator)

1. Parameters: The function accepts two parameters which are described below:
   • list2-name – It specifies the list2 which is to be merged in list1.
   • comparator – It is a binary predicate which takes two values of the same type that of those contained in the list, returns true if the first argument is considered to go before the second in the strict weak ordering it defines, and false otherwise.

My Personal Notes arrow_drop_up

Save