1. Given an array of integers a dimension n. If the array contains the same number...

1. Given an array of integers a dimension n. If the array contains the same number of even and odd elements get (a1 + an) (a2 + an-1) ...
2. Given an array of integers dimension n. All array elements with even numbers preceding the first element to the maximum, multiplied by the maximum.
3. Given an array of dimension n. Insert after each zero element of the element in the middle (or the amount of secondary elements for even n). In the resulting array to remove the first negative and the second positive elements. Optional array is not used.
4. Dana matrix of dimension nxn. Get a one-dimensional array that stores the sum of the elements descending diagonal matrix.

Solutions

Expert Solution

The code is provided below in c++

The output is shown below for array size 6(even size)

The code is provided below in c++

Here, the first 4 elements are initial array elements and remaining are modified array elements and output is shown below:

The code is as follows

Output is as follows:

venereology answered 1 year ago

Next > < Previous

Related Solutions

P1 Consider an array of length n that contains unique integers between 1 and n+1. For...

P1 Consider an array of length n that contains unique integers between 1 and n+1. For example, an array A1 of length 5 might contain the integers 3, 6, 5, 1, and 4. In an array of this form, one number between 1 and n+1 will be missing. In A1, the integer 2 is missing from the array. As another example, consider the array A2 that contain the integers 4, 7, 5, 2, 6, and 1. A2 has size 6,...

An array A[0..n - 2] contains n-1 integers from 1 to n in increasing order. (Thus...

An array A[0..n - 2] contains n-1 integers from 1 to n in increasing order. (Thus one integer in this range is missing.) Design an algorithm in (Theta(log n)) to find the missing integer. Your algorithm should be given in pseudo code. For example, the array A could be {1, 2, 3, 4, 6, 7, 8, 9, 10} in which 5 is missing.

Given an array A[1..n] of integers - all of whose numbers are in the range [0,...

Given an array A[1..n] of integers - all of whose numbers are in the range [0, n^3 − 1] give an algorithm which sorts them in O(n) time.

Given a positive integer k and an array A[1..n] that contains the quiz scores of n...

Given a positive integer k and an array A[1..n] that contains the quiz scores of n students in ascending order, design a divide and conquer algorithm to efficiently count the number of students that have quiz scores in (100(i − 1)/k, 100i/k] for integers 1 ≤ i ≤ k. Let group i be the set of students with quiz scores in (100(i − 1)/k, 100i/k] for integers 1 ≤ i ≤ k. The counting result should be stored in G[1..k],...

Write a C++ program to find the number of pairs of integers in a given array...

Write a C++ program to find the number of pairs of integers in a given array of integers whose sum is equal to a specified number.

Let A be an array of non-decreasing N integers. Write an algorithm that returns the number...

Let A be an array of non-decreasing N integers. Write an algorithm that returns the number of pairs of integers in A that are equal. Analyze your algorithm thoroughly. Your analysis should include a thorough examination of both the best and the worst-case scenarios. This includes a description of what the best and worst cases would look like. You should include both space and time in your analysis, but keep in mind that space refers to “extra space,” meaning in...

write a code for given an array of integers where wachelement represents the maximum number...

write a code for given an array of integers where wach element represents the maximum number of jumps to reach the end of the array(starting from the first element) if an element O,then no jump can be made from that element if it is not possible to reach the end then output in c

Use C Programming - Given an array of integers and a number K, find the smallest...

Use C Programming - Given an array of integers and a number K, find the smallest element in array greater than or equal to K. If such element exists in the array, display it otherwise display "-1". Example: Input: 8 1 3 4 7 8 9 9 10 5 where: First line represents the number of elements in the array. Second line represents the elements in the array. Third line represents the value of K. Output: 7 Explanation:...

Consider the problem of sorting an array A[1, ..., n] of integers. We presented an O(n...

Consider the problem of sorting an array A[1, ..., n] of integers. We presented an O(n log n)-time algorithm in class and, also, proved a lower bound of Ω(n log n) for any comparison-based algorithm. 2. Give an efficient sorting algorithm for an array C[1, ..., n] whose elements are taken from the set {1, 2, 3, 4, 5}.

We have an array A of size n. There are only positive integers in this array....

We have an array A of size n. There are only positive integers in this array. Note that the array may have integers that are not distinct, and it could be any array of positive integers in creation (I like the numbers found the decimal expansion of π for instance). When possible provide the exact complexity of the algorithm. If it’s not possible explain the O/Ω/Θ complexity. a. Design an efficient algorithm to find the maximum difference between any two...

Subjects