The following algorithm adds all the entries in the "upper triangular" part of a square n ×ばつ n array A. Consider n = 5 and the 5 ×ばつ 5 array below. What will the ending value for sum be for this algorithm and the array below? sum = 0 for k = 1 to n do for j = k to n do sum = sum + A[k, j] end for end for

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

Compute the distance between the positions of the first and last zero element in the given array. For example, if the array is 3 0 1 0 4 9 5 0 6 your algorithm should yield 7 - 1 = 6. If the array contains a single zero, return 0. If it doesn't contain any zeroes, return a negative value.

Write the algorithm which finds the second maximum value of the array. Then find the complexity of the algorithm as Big O notation

Python Programming

Check if Array Elements are Consecutive in Java. Given an array, we need to check if array contains consecutive elements. For example: Input: array[] = {5, 3, 4, 1, 2} Output: true As array contains consecutive elements from 1 to 5 Input: array[] = {47, 43, 45, 44, 46} Output: true As array contains consecutive elements from 43 to 47 Input: array[] = {6, 7, 5, 6} Output: false As array does not contain consecutive elements.

do not plagiarise