Write a C++ program to implement quick sort for n elements.  Then run the program with the following inputs: (a). an arbitrary input, (b). sorted input, (c). reverse-ordered input,   (d). an  input that all elements are equal.   Please provide screenshots of the code, and the output of each (4) inputs. Total 5 screenshots.    Thanks!

Write a c++ program to add two large integers with up to 300 digits. One approach is to treat each number as array, each of whose elements is a block of digits of that number. For example, the integer 179,534,672,198 might be stored as block[0] =198, block[1] = 672, block[2] = 534, block[3] = 179. Add the two integers (lists), element by element, carrying from one element to the next when necessary. NOTE: You don’t have to use string input for the numbers. {Hint: when does the extraction stop extracting characters from the input buffer? How does the get function work? What character is always placed in the input stream when you press enter } The user will input the numbers using the following format: User input is in bold and underlined. Enter the number using this format(###,###,###) up to 300 digits: 179,534,672,198 Enter the number using this format(###,###,###) up to 300 digits: 564,325 Addition Result: 179,535,236,523 Enter the number using this format(###,###,###) up to 300…

3. Write a Java program to test if an array contains a specific value.  PS: Please upload the output and say the logic behind it. Thank you!

Write a program that reads a list of integers from input into an array and outputs "yes" if the list is sorted in ascending order between two provided positions. Otherwise, output "no". The first input specifies the number of items in the list. The next set of inputs is the list. The last two inputs are the start and end positions (inclusive). Assume the list contains less than 20 integers and position 1 is the first element. Ex: If the input is: 8 5 6 7 4 3 2 1 0 1 3 the output is: yes Ex: If the input is: 6 1 2 3 4 5 2 4 6 the output is: no