Code two versions of Quicksort algorithms, one using the Lomuto method and one using the Hoare method. Clearly document your code so that it is clear how and why your algorithms are correct. For each of the two algorithms the output must be the following three items: the total numberof comparisons, the total number of swaps, and the total running time. Demonstrate your two Quicksort algorithms on the input array A= [2, 8, 7, 1, 3, 5, 6, 4].

In python, count the neighboring *'s of each individual element in this array:    * * . . .        . . . . .          . * . . .      then output an array where each element is replaced with the numbers of *'s above below and diagonal to them.  The output should look like this: * * 1 0 0  3 3 2 0 0  1 * 1 0 0

With c programming and without pointer and function   You are given an array of N positive integers. Find the maximum even values from the array. For finding the maximum even values from the array you can perform only one of the following operations. Choose any even value from the array. Choose any two(must be different) values from the array and perform summation on those two values. If it will even you can pick those two values. It is guaranteed that all the integers are distinct and at least one operation will exist in the given input. Input Format The first line contains a single positive integer N. The second line will contain N positive integers A1,A2,A3,A4…..An Constraints 1 <= N <= 10 1 <= A[i] <= 20 where (0 <= i < n) Output Format Print a single positive integer, the maximum even value. Sample Input 0 52 4 6 8 10 Sample Output 0 18 Explanation 0 In this case, we can choose 8 and 10, the summation is…

Python Programming