Algorithm1(A[0 .... n– 1]) // Input: Array A[0 .... n– 1] of numbers count 0 for i= 0 to n do for j=i to n do if A[i] – A[j]] < 10 | count count + 1 return count

Don't give me AI generated answer or plagiarised answer. If I see these things I'll give you multiple downvotes and will report immediately.

Implement an empty integer array of capacity 5. a) Use a loop to input values from the console into the array. b) Use a loop to determine the smallest element in the array. c) Use a loop to determine the largest element in the array. d) Use a loop to output the array. e) Output the smallest and largest elements. Example Output [0] = 4 [1] = 24 [2] = 123 [3] = 54 [4] = 3 Array: 4 24 123 54 3 Max: 123 Min: 3   programming language is c++ pleasw do it in a easy way