Quicksort is very efficient in practice and has an expected running time O (n log(n)). Why  would anyone ever use Merge Sort over Quicksort?

Create a quicksort implementation that is nonrecursive and uses a main loop to put the partitioned subarrays back onto the stack after they have been created. To ensure that the stack has at most lg N entries, push the bigger of the two subarrays onto it first.

I need to design, analyze, and implement algorithms to read in a sequence of characters from standard input and maintain the characters in a linked list with no duplicates. When read in a previously unseen character, insert it at the front of the list. When read in a duplicate character, delete it from the list and reinsert it at the beginning. The program implements the well-known move-to-front strategy which is useful for caching, data compression, and many other applications where items that have been recently accessed are more likely to be re-accessed. The program should read a sequence of characters and should insert unseen character at the front of the list. The program should check if the character is not in the list to be inserted at the front of the list. The program should delete a duplicate character and delete it from the list and insert it at the beginning of the list. The program should check if the character is already in the list and delete the character from the list…