How can I quickly copy an array of shared pointers into a new array in C++? Create a list of potential responses to the problem at hand. If I duplicate a shared pointer, will I also copy the object it points to? Explain

Could I get an example of a program writen in C that uses qsort() to sort its command line vector argv by the length of the strings? This is part of my first project and I don't understand pointers very well. If you have a video on how it is done that would work too. I looked at the meterial provided to me and I still cant rap my head around it. If this is to big of a question if you could baby step me through how pointers work that would be a great help. Thank you

Explain the pointer soting with help of pseudo code?

I'm stuck on this question and I don't know how I should be approaching this. What should I do? Our focus is on pointers and dynamic arrays through C++

There have been reports of hanging and wild pointers being an issue with the pointers? provide a good illustration

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. char algorithm1(char c,int s){    if (isalpha(c))    {        c = toupper(c);        c = (((c - 65) + s) % 26) + 65;    }    return c;} int algorithm2(string input){    do    {        string output = "";        int shift = rand() % 26;        for (int x = 0; x < input.length(); x++)            output += algorithm1(input[x],shift);        cout << output << endl;    }    while…