Implement the QuickSort algorithm in C++. Requirement Input of the program: Unsorted list of integers separated by spaces; your program must read input file containing the numbers to be sorted. Output of the program: Sorted list of inputted integers separated by spaces in ascending order. Pivot: you need to infuse randomness for choosing pivot; you come up with an idea and explain it as comments in your program.

Given a list of n integers, write a C++ program to sort these integers usingmerge sort. Print to the screen the sorted list.The program requires that integers in the list are from user input. You can make theassumption that user input numbers are all integers and there is no improper input.   Additional requirements and reminders (IMPORTANT): 1) You must use the merge sort algorithm to sort the list of integers. You mustuse recursion in your program.2) The list of integers must from user input. You may not hardcode it in your program.

I need to solve this in C++ code  When analyzing data sets, such as data for human heights or for human weights, a common step is to adjust the data. This can be done by normalizing to values between 0 and 1, or throwing away outliers. For this program, adjust the values by subtracting the smallest value from all the values. The input begins with an integer indicating the number of integers that follow. Assume that the list will always contain less than 20 integers. Ex: If the input is: 5 30 50 10 70 65 the output is: 20 40 0 60 55 For coding simplicity, follow every output value by a space, even the last one. Your program must define and use the following function:int GetMinimumInt(vector<int> listInts) Note: This is a lab from a previous chapter that now requires the use of a function.

Write a function named "sort_word" that declares a parameter for a word and returns a string with the characters from the original word in sorted order. Hint: use the built-in Python sorted() function to convert the string into a sorted list of characters, and then use a for loop to convert the list back into a string. For example, given the word "tea", you would translate it into the String "aet". and return it.   Write a function named "make_anagrams", that accepts a collection of unique words as a parameter and returns a dictionary. For each word in the collection: Call your "sort_word" function to obtain the sorted version of the word. Use the sorted word as the key in a dictionary. The value in the dictionary will be a list of any words that contain the exact same characters. To be clear: if you call your "sort_word" function with any word with the same characters in a different arrangement (e.g. "tea," "ate," or "eat"), you should receive the same key, and therefore store the…

in c++ please paste working code. the program should  Input- Julia Lucas Mia -1 With an expected output of-  Julia Lucas Mia Julia Mia Lucas Lucas Julia Mia Lucas Mia Julia Mia Julia Lucas Mia Lucas Julia

Write a version of the sequential search algorithm that can be used to search a sorted list. Write a program to test the sequential search algorithm. Use either the function bubbleSort or insertionSort to sort the list before the search. Your program should prompt the user to enter 10 digits and then prompt the user to enter a digit to search - if the list contains this digit, output its position to the console: x is found at position y If the digit is not contained in the list, output the following: x is not in the list