Reference the image below. (a) Write a code in python to implement Hoare's algorithm. (b) Using LArray = {36, 12, 39, 34, 89, 2, 47, 95, 17, 19, 78, 22} as input, display the final output and the array LArray after it has been manipulated by the algorithm. (c) Modify the algorithm to display the LArray after each swap done, being sure to indicate what swap is being observed.

Use a loop with indirect or indexed addressing to reverse the elements of an integer array in place.Do not copy the elements to any other array. Use the SIZEOF, TYPE, and LENGTHOFoperators to make the program as flexible as possible if the array size and type should be changedin the future.

Write, and test using spim, an assembly language program that accepts asinput a sequence of 10 integers. These numbers should be stored in an array in memory,in the order in which they were input. Then, your program should prompt the user foran integer input and search the array to find the first occurrence (if any) of this integer.If found, output its position in the array as an integer between 1 and 10. Again, youneed only find the first occurrence. Your program should then prompt the user foranother integer input, and repeat. Once the input integer is NOT found in the array, yourprogram should terminate.

Build a flowchart for this program using an insertion sort. 1. leave out getScores(), displayScores(), and swap() functions calls to them. 2. In the main() module, reduce the scores[ ] array to 6 and initialize it with these numbers upon declaration: [9, 5, 1, 6, 9, 4]. 3. Also in the main() module, replace the call to displayScores() with one line that will display all the array's contents: Display scores. 4. And to swap array elements, replicate the whole insertionSort() function as you see on page 444

Reference the algorithm in the picture below:  (a) Write code in python to implement the Quicksort algorithm. Your code should print both the inputand output arrays to the screen.(b) Using the list LArray = {26, 14, 52, 7, 15, 37, 91, 2, 28, 73} illustrate how quicksortworks.(c) Using the list LArray = {37, 91, 2, 26, 14, 52, 7, 28, 15, 73} illustrate how quicksortworks

C++

Given two sorted arrays, write a function to merge them into a single sorted array. What is the time complexity of your solution?

Write a loop in assembly that increments each element of array x as defined in the previous problem. The size of the array (6) may be hard-coded. Previous Problem array: x dq 43,12,13,53,-1,21