Write in a programming language (PL), a program to fill an NxN two- dimensional array, in a circular (spiral) pattern, with numbers from 1 to N2 as described below. You can do that by writing first the following functions/procedures which you will call in the main program.The procedure FillColumnUpward(A, top, bottom, left, z) which takes the array A the top, bottom and left as parameters and iterates through the left column from bottom to top to fill the column. 2. There are many different ways of placing the numbers 1 to N'into an N x N two dimensional array.The following two-dimensional array, with dimensions 5x5, has been filled in a circular(spiral) pattern with numbers I to 5An algorithm to fill an NxN two-dimensional array, in a circular (spiral) pattern,with numbers from I to N' is given as follows:• initialize Z-1,•initialize TOP, BOTTOM, LEFT and RIGIHT.• iterate until the whole array is filled.• cach time Z is placed correctly increase the value of Z by 1.• fill the elements of the TOP row starting from LEFT to RIGHT.• increase TOP by I before filling the clements of the RIGHT column.• fill the clements of the RIGHT column starting from TOP to BOTTOM.• decrease RIGHT by I before filling the clements of the BOTTOM row.• and continue filling the BOTTOM row and LEFT column in a similar way.adjusting TOP, RIGHT, BOTTOM and LEFT accordingly.LEFTRIGHT[0](1][2][3][4]TOP(0]14[1]1617196.[2]15 24257[3]1423228[4]13121110BOTTOMFigure 22021182.

Algorithm: Create and initialize variables k – starting row index, m – ending row index, l –…

Write in a programming language (PL), a program to fill an NxN two- dimensional array, in a circular (spiral) pattern, with numbers from 1 to N2 as described below. You can do that by writing first the following functions/procedures which you will call in the main program. The procedure FillColumnUpward(A, top, bottom, left, z) which takes the array A the top, bottom and left as parameters and iterates through the left column from bottom to top to fill the column.

Write in a programming language (PL), a program to fill an NxN two- dimensional array, in a circular (spiral) pattern, with numbers from 1 to N2 as described below. You can do that by writing first the following functions/procedures which you will call in the main program. The procedure FillColumnUpward(A, top, bottom, left, z) which takes the array A the top, bottom and left as parameters and iterates through the left column from bottom to top to fill the column.

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter6: Arrays

Section: Chapter Questions

Problem 17RQ

See similar textbooks

Similar questions

Write a script in Python to play two-dimensional Tic-Tac-Toe between two human players who alternate entering their moves on the same computer. Use a 3-by-3 two-dimensional array . Each player indicates their moves by entering a pair of numbers representing the row and column indices of the square in which they want to place their mark, either an 'X' or an 'O'. When the first player moves, place an 'X' in the specified square. When the second player moves, place an 'O' in the specified square. Each move must be to an empty square. After each move, determine whether the game has been won and whether it’s a draw.
Python: Write a script to play two dimensional Tic-Tac-Toe between two human players who alternate entering their move on the same computer. Use a 5-by-5 two-dimensional array. Each player indicates their moves by entering a pair of numbers representing the row and column indices of the square in which they want to place their mark, either an 'X' or an 'O'. When the first player moves, place an 'X' in the specified square. When the second player moves, place an 'O' in the specified square. Each move must be to an empty square. After each move, determine whether the game has been won and whether it’s a draw. print the total number of moves it takes to have a win or draw. Now modify your script to create a tournament of three Tic-Tac-Toe games and print out which player wins at the end of a tournament.
Take an array of length n where all the numbers are nonnegative and unique. Find the element inthe array possessing the highest value. Split the element into two parts where the first part containsthe next highest value in the array and the second part holds the required additive entity to get thehighest value. Return the array index value. Consider the negative numbers as well.Input: [4, 8, 6, 3, 2]Output: [4, 6, 2, 6, 3, 2]
Rewrite this code, using modular programming style, and correcting any errors if necessary. 2. Optimize the algorithm by making the following modifications: (a) After the first pass, the largest number is guaranteed to be in the highest- numbered element in the array; after the second pass, the two highest numbers are "in place," and so on. Instead of comparing every pair on every pass, modify the algorithm to make as few comparisons as necessary on each pass. (b) Modify the algorithm to check at the end of each pass if any swaps have been made. If none have been made, the data must already be in the proper order, so the program should terminate. Observe the single-exit point rule when making this modification. 3. Insert appropriate statements in your code to output the state of the array after every pass. #include <iostream> #include <iomanip> using namespace std; using std::setw; using std::cout; using std::endl; using std::size_t; int main() { const short…
9.). integer array nums and an integer k, return the length of the shortest non-empty subarray of nums with a sum of at least k. If there is no such subarray, return -1. A subarray is a contiguous part of an array. Example 1: Input: nums = [1], k = 1 Output: 1 Example 2: Input: nums = [1,2], k = 4 Output: -1 Example 3: Input: nums = [2,-1,2], k = 3 Output: 3.
1.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.
Please Help me with This Problem Language = C++ Take an array of name A of size 4 X 4. Take input and then take B with size 4 X 4. Add them.And show result after taking transpose.Formally, the i th row, j th column element of C T is the j th row, i th columnelement of C:1. write the rows of C as the columns of C T2. write the columns of C as the rows of C TC is an m × n matrix then C T is an n × m matrix.Then save the result in a file named “result.txt”, according the matrix spaces and newline. Note:Understand the Question Properly and Kindly Answer
Given two arrays A and B of equal size N, the task is to find if given arrays are equal or not. Two arrays are said to be equal if both of them contain same set of elements, arrangements (or permutation) of elements may be different though.Note : If there are repetitions, then counts of repeated elements must also be same for two array to be equal. Example 1: Input: N = 5 A[] = {1,2,5,4,0} B[] = {2,4,5,0,1} Output: 1.
You can see in the above display, we first sort each row of the 2D array; we then take the transpose of a two D array, i.e., all the row elements becoming the column elements; we then sort each row of the 2D again. If you read the final array, each row is sorted; each column is also sorted. The smallest element obviously is the 1st element of the two D array and the last element is the largest element of a two D array. Let us now look at the following UML diagram: (Note that additional methods are allowed; proposed methods and instance variable cannot be changed) Main method firstly constructs a 2D array of certain sizes and then construct a TwoD object and drive the task according to the above runtime interactions and displays. TwoD class has only one instance variable which is a two D array of numbers ( int or double). The constructor must do some “deep” copying. A copy constructor. The other three methods are obvious in definition: to sort each row, to rotate the 2D array (i.e.,…
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.
Given an array as follows5 4 9 10 2 8 1 3 7 6 Suppose we partition this array using quicksort's partition function and using 5 for the pivot. A) Draw the resulting array after the partition finishes.B) The following is an array which has just been partitioned by the first step of quicksort:3 0 2 4 5 8 7 6 9Give all the elements that could be the pivot? (There may be more than one possibility!) PLEASE HELP WITH PART A AND B AND SHOW WORK!!
Plot the result of (given) selectionsort(A) when A is a perfectly sorted and contains randoms integers ,0 to 100 inclusive, for array sizes n = 2,4,8,16,..1024. please provide code for A and generating the plot for each doubling array, as well as the resulting plot. def selectionsort(A): for i in range(len(A)): min_idx = i for j in range(i + 1, len(A)): if A[min_idx] > A[j]: min_idx = j A[i], A[min_idx] = A[min_idx], A[i] return A