Given an integer **n**, create a two-dimensional array of size **n×n** according to the following rules and print it: - On the main diagonal put `0`. - On the diagonals adjacent to the main put `1`. - On the next adjacent diagonals put `2`, and so forth. # Example input ``` 5 ``` # Example output ``` 0 1 2 3 4 1 0 1 2 3 2 1 0 1 2

Given an integer n, create a two-dimensional array of size n×n according to the following rules and print it: - On the main diagonal put `0`. - On the diagonals adjacent to the main put `1`. - On the next adjacent diagonals put `2`, and so forth. # Example input ``` 5 ``` # Example output ``` 0 1 2 3 4 1 0 1 2 3 2 1 0 1 2

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 11PE

See similar textbooks

Similar questions

Read in two integers n and m (n, m < 50). Read n integers in an array A. Read m integers in anarray B. Then do the following (write separate programs for each, only the reading part iscommon).a) Find if there are any two elements x, y in A and an element z in B, such that x + y = z.b) Copy in another array C all elements that are in both A and B (intersection).c) Copy in another array C all elements that are in either A and B (union).d) Copy in another array C all elements that are in A but not in B (difference).c programm please tell all the answer
6. Read in two integers n and m (n, m < 50). Read n integers in an array A. Read m integers in anarray B. Then do the following (write separate programs for each, only the reading part iscommon).a) Find if there are any two elements x, y in A and an element z in B, such that x + y = z.b) Copy in another array C all elements that are in both A and B (intersection).c) Copy in another array C all elements that are in either A and B (union).d) Copy in another array C all elements that are in A but not in B (difference).Do In c Program
Read in an integer n (n < 25). Read n integers in an array A. Then do the following (writeseparate programs for each, only the reading part is common).a) Find the sum of the absolute values of the integers.b) Copy the positive and negative integers in the array into two additional arrays B and Crespectively. Print A, B and C.c) Exchange the values of every pair of values from the start (so exchange A[0] and A[1],A[2] and A[3] and so on). If the number of elements is odd, the last value should stay thesame.
Read in an integer n (n < 25). Read n integers in an array A. Then do the following (writeseparate programs for each, only the reading part is common).a) Find the sum of the absolute values of the integers.b) Copy the positive and negative integers in the array into two additional arrays B and Crespectively. Print A, B and C.c) Exchange the values of every pair of values from the start (so exchange A[0] and A[1],A[2] and A[3] and so on). If the number of elements is odd, the last value should stay thesame.write c program
input an unsorted array A of n number and an integer k with 1<= k <= n. output an array B of size k that contains the k largest numbers in A with B[1] >= B2....>=[k] index of the array starts from 1 1. write algorothim pseudocode. analyze the bestcase .k . analyze the worse case of k.
Write a program that reads integers between 1 and 100 and countsthe occurrence of each number. Assume the input ends with 0 and that the maximum capacityof the array is 100
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
import math array = [4, 5, 6, 7, 8, 9, 33, 24, 15, 11] print("Original array") print(array) print() # Get no. of elements n = len(array) s = math.floor((n-1)/2) e = math.floor(n/2) # while loop while (s >= 0 and e <= n-1): # swap the numbers array[s], array[e] = array[e], array[s] s = s-1 e = e+1 # now array is reversed print("Reversed array") print(array) Check this code and ,using time measurements, test your algorithm and plot a graph that shows its growth rate when variating the size.
in java Create two arrays with same length n: - Array A with integer numbers that user will insert- Array B with random numbers from 0 to 100.- Find sum of both arrays,- Find maximum values of both array and compare them: .if maximum of 1 st is lower then maximum of 2nd array: print sums of both arrays.if maximum of 1st is greater then maximum of 2nd array print 2nd array (use println)otherwise print first array in reverse.
Given an array arr[] and an integer K where K is smaller than size of array, the task is to find the Kth smallest element in the given array. It is given that all array elements are distinct. Note :- l and r denotes the starting and ending index of the array. Example 1: Input: N = 6 arr[] = 7 10 4 3 20 15 K = 3 Output : 7.
Write a program to copy one array of size 24 to another array of size 24 using string instructions. Write 3 versions of this code. One code must copy byte at a time. One code must copy word at a time and one code must copy double word at a time. Cut and paste the array in memory to show your code is working.
Given a group of characters a circular array AL]. It is required for each one to print the index of the first bigger character on its right. Print -1 if no one is bigger than it. Example 1: Explanation of example 1: (reter to the figure below) The given array All of character is as follows: AQ={L,B.Q.F.T.M A[index] A[0] A[1] A[2] A[3] A[41 A[5) Output: ContentL B Q Zu2 4 4 -1 2 O Regarding "L", the first bigger character on its right is Example 2: "Q' (i.e., A[2]), and hence 2 is printed. AI={J,P,S,D,N} O Regarding and hence "B" 2 is printed again has also the same on her right, Output: D... and so on. 1.2 -1 4 1 a) Describe how a brute-force approach algorithm would solve the above problem, and explain its complexity. b) Design a more efficient algorithm to solve this problem. [The efficiency of your algorithm is the main driver of the mark], and analyze the complexity of your solution. [full explanation of your answer should be provided] c) Develop a python code to implement your…