Quicksort SPLIT (the 2-pointer algorithm covered in class) is applied to the integer array [4,3,5,7,9,2,1], using the first entry as the pivot.  Show the series of item swaps that are performed in the split process, and the array after each of these swaps, up to and including the step of placing the pivot at its correct location. You only need to show the split of the original array, you are not required to continue working on the subarrays after the split.

Implement ONE array of the English alphabet (26 characters). a) Use a loop to cast and generate the array. b) Use a loop to output the array. c) Create a swap function for swapping character variables. d) Use a loop and the swap function to reverse all array elements. e) Use a loop to Output the updated array. Hint: Set a variable for the first and last indices. Swap those values. Gradually move the first/last pointers to the middle of the array, swapping as you go. When the middle is reached, the array will be reversed. Example Output Original: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z Reversed: Z Y X W V U T S R Q P O N M L K J I H G F E D C B A   its c++ do it in a easy way thankyou

Write the function lastOf which searches the array a for the last occurance of any value contained in the array b. Returns the index if found. If not found, return -1. arrays.cpp 1 #include 2 int last0f(const int a[], int alen, const int b[], int bLen) { 3 4 5 6 7 8 }

Assume that the integer array myScores has been declared and assigned values. Assume that the integer variable size has been declared and initialized using the number of elements in the array myScores. Write a code block that declares a pointer to an integer and initializes it using the address of the array. Use that pointer to access the array elements, compute their average (as double), and display it on the screen.