When learning about using Divide and Conqueror algorithms with maximum sub arrays. How do I approach in the process of solving using either Brute force, divide and conqueror, and Kadanes algorithm for figuring out the sum of any random order of a given array??

Prove by induction that the solution ta the following recurrence captures the running time of constructing a BST from a sorted array is O(n) Assume T(1)= 1. T(n) <= 2T(n/2) + 5. for 1 Write the proof by showing that T(n) <= an +b, for some constants a and b, and derive the values of a and b from the proof

Show how quicksort can be made to run in O(nlogn) time in the worst case. Assume the input array is A[0:n-1] and all elements in A are distinct. Write your answer as pseudo-code and use plain language to explain the idea of your algorithm. (Hint: you can use any algorithm helper functions in parts of the designed algorithm. If you use an algorithm, you can directly call the function name in the pseudo-code without expanding the details of the helper function, as long as you clearly explain the meaning of the helper function.)

I am just needing pseudo code, and an explanation for this. I do not need any actual code. Thank you. Assume that algorithm X, which is an algorithm that can iterate through an array A, has been solved. Let Y be some new algorithm that can find the minimum element in the array. Use reduction to prove that Y is possible.