Write a merge function that takes pointers to two sorted lists as arguments and returns a pointer to a merged list in C++.

4. Implement the find() function for a Set STL data structure in C++ that takes an integer x as the parameter and returns true if x is present in the set. Otherwise, returns false.

Write a program in c++ to remove duplication if exists in the linked list. Write 2 separate functions to perform search and other to perform the duplication removal.   Note: the above mentioned task is to be performed using singly linked list and in c++

Write some C++ code to sort an array of predefined data types using a template function.

use Advanced C++ techniques, containers and features to refactor the C/C++ algorithm.  The purpose is toreplace appropriate declarations and code segments with Advanced C++ declarations and code. * Replace all arrays with appropriate STL containers. * Use STL algorithms to REPLACE existing logic where appropriate. * Use smart and move pointers where pointers are needed.  * Use lambda expressions where appropriate. * Use C++ style casting when needed. * Look for opportunities where tuples could be used. * The code listing is in C and C++. If there are logic or syntax problems, please fix. #define BIND(A,L,H) ((L)<(A)?(A)<(H)?(A):(H):(L)) char  dih[50],dah[50],medium[30],word[30],*dd[2] = {dih,dah};const char  *ascii = "ABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789.,?'!/()&:;=+-_\"$@",  *itu[] =…

Write a merge function that takes pointers to two sorted lists as arguments and returns a pointer to a merged list in C++. Please explain with detailed. Thank you!

c++  First, write a function which will find the sum of all elements of one-dimensional array:       2.0,4.0,6.0,8.0,10.0 declared and list initialized in main(). Then use a call by reference in main(), and display the value of the sum as the function’s return value.