Given the user input in this format: 5 bwwww wwwww bbwwb bbbbb wbbww Where size = 5, and the follolwing characters are apart of array1[][] (2D array). Given is an n × n grid where each cell is either colored black or white. Give an O(n2) algorithm that finds the largest k such that there is an all-white k × k square in the grid.

Given the user input in this format: 5 bwwww wwwww bbwwb bbbbb wbbww Where size = 5, and the follolwing characters are apart of array1[][] (2D array). Given is an n × n grid where each cell is either colored black or white. Give an O(n2) algorithm that finds the largest k such that there is an all-white k × k square in the grid.

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 24PE

See similar textbooks

Similar questions

Given an array arr[] of N non-negative integers representing the height of blocks. If width of each block is 1, compute how much water can be trapped between the blocks during the rainy season. Example 1: Input: N = 6 arr[] = {3,0,0,2,0,4} Output: 10.
An array A contains n - 1 unique integers in the range [0, n - 11; that is, there is one number from this range that is not in A. Design an O(n)- time algorithm (write a pseudo-code, Python function or Java method) for finding that number. You can use only 0(1) additional space beside array A.
Given an 8-element array: A = {x1, X2, X3, X4, X5, X6, 7, x8}, we would like to find its 3rd smallest element. It is known that x₁ and 8 are the two extreme elements: max and min, but we do not know which one is the max and which one is the min. It is also known that x4 and x5 are the two medians: left-median and right-median. What is the minimum number of comparisons you need to find the 3rd smallest element of the original array? Ans:
You are given an array A[1 : n] which includes the scores of n players in a game. You are additionally given an array B[1 : m] with the score of m new players. Design and analyze an algorithm that given both arrays A and B, can find the rank of each player B inside the array A, i.e., for each B[i], determines what would be the rank of B[i] in the array consisting of all elements of A plus B[i]. Your algorithm should run in O((n + m) ·log n) time.
Given an array A[] of size n. The task is to find the largest element in it. Example 1: Input: n = 5 A[] = {1, 8, 7, 56, 90} Output: 90 Explanation: The largest element of given array is 90.
You are given an array J[1 : n] which includes the scores of n players in a game. You are additionally given an array P[1 : m] with the score of m new players. Design and analyze an algorithm that given both arrays J and P, can find the rank of each player P inside the array J, i.e., for each P[i], determines what would be the rank of P[i] in the array consisting of all elements of J plus P[i]. Your algorithm should run in O((n + m) ·log n) time.
Write a program that randomly fills in 0s and 1s into a 4x4 matrix, prints the matrix, and finds the rows and columns with the most 1s.
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.
Given a binary array A[] of size N. The task is to arrange the array in increasing order. Note: The binary array contains only 0 and 1. Example 1: Input: 5 1 0 1 1 0 Output: 0 0 1 1 1 Explanation: After arranging the elements in increasing order, elements will be as 0 0 1 1 1.
You are given an array A[1 : n] which includes the scores of n players in a game. They areranked in the following way: Rank of a player is an integer r if there are exactly r −1 distinct scores strictlysmaller than the score of this player (irrespective of the number of players). Question: Design and analyze an algorithm that given the array A, can find the rank of all players in the arrayin O(n log n) time.
Create an array of size one million (1,000,019). Fill it in reverse sequentially with values (e.g. array[0] should equal 1,000,018, array[1] should equal 1,000,017, etc). Then the computer should select a random target number between 0 and array size – 1. You should then search the array for this value twice – once with a linear search algorithm, and then with a binary search algorithm. Start searching from the end of the array, rather than the beginning. Keep track of how long each one took, using the following criteria: Linear Search: Number of loop iterations before the target number was found Binary Search: Number of midpoints chosen (a.k.a “guesses”) taken before the target number was found Once both algorithms have been run, display the results and print which algorithm found the number first (or if there was a tie). Once both algorithms have been run, display the results and print which algorithm found the number first (or if there was a tie). In the rest of this assignment,…
in java ecplise . Implement a program that randomly generates 10 integers from -100 to 100,stores them in a 1D array, and finds their maximum value. Calculate theexecution time of finding a maximum. Repeat the test for 10,000 and10,000,000 numbers. Provide your results in the form of a table below andprovide a small summary. Implement a Java program that will populate a 5x5 matrix with randomlygenerated integers from 0 to 100.(1) print your matrix in a table form.(2) modify your code to multiply all even numbers by 10 and print the matrix.Your output of questions (1) and (2) should match the format of the followingsample outputs: