Write an efficient algorithm (to the best of your knowledge) for the following problem, briefly describe why it is a correct algorithm, provide pseudocode, and analyze the time complexity. Problem: RobotWalk Input: An array A[0...n,0...n] of positive integers. A robot that starts at position A[0,0] and wants to reach A[n,n]. At each step, the robot can only move on step either rightward, along the diagonal, or downward. For example, if the current position is (i,j), then the next possible positions are (i,j+1), (i+1,j+1), or (i+1,j). The cost of a path is the sum of the entries that the robot visits. Output: The most expensive path that the robot can take. Example: Input: A = 50 (robot Starts at A[0,0]) 20 30 10 10 10 10 40 40 (robot ends at A[n,n]) Output: 160 (because of the path 50 -> 20 -> 10 -> 40-> 40.

Write an efficient algorithm (to the best of your knowledge) for the following problem, briefly describe why it is a correct algorithm, provide pseudocode, and analyze the time complexity. Problem: RobotWalk Input: An array A[0...n,0...n] of positive integers. A robot that starts at position A[0,0] and wants to reach A[n,n]. At each step, the robot can only move on step either rightward, along the diagonal, or downward. For example, if the current position is (i,j), then the next possible positions are (i,j+1), (i+1,j+1), or (i+1,j). The cost of a path is the sum of the entries that the robot visits. Output: The most expensive path that the robot can take. Example: Input: A = 50 (robot Starts at A[0,0]) 20 30 10 10 10 10 40 40 (robot ends at A[n,n]) Output: 160 (because of the path 50 -> 20 -> 10 -> 40-> 40.

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

Write an efficient algorithm (to the best of your knowledge) for the following problem, briefly describe why it is a correct algorithm, and analyze the time complexity. If you cannot find any polynomial-time algorithm, then give a backtracking algorithm. Problem: Repeated Number Input: An array A[1...3n] of positive integers. Output: If any number in the array appears at least n times, then print such a number. Otherwise, print 'none'. Example: Input: A = [1,3,3,3,1,1]. Here 3n = 6 and n =2. Output: 3. Note that here 1 would also be a valid output. You just need to print one if there are many options. Example: Input: A = [4,3,5,7,9,1]. Here 3n = 6 and n =2. Output: 'none'
Given an unsorted array A of integers of any size, n ≥ 3, and an integer value x, write an algorithm as a pseudo code (not a program!) that would find out if there exist EXACTLY3 occurrences in the array with value x. What is the time complexity of your algorithm, in terms of Big-O? What is the space complexity of your algorithm, in terms of Big-O? What if , the given array A is sorted. Will time complexity change from the case that A was unsorted? • If yes; give a new algorithm that achieves this better complexity (indicate the time complexity as of that algorithm). • If no, explain why such new constraints/conditions cannot lead to a better time complexity.
Write an efficient algorithm for the following problem (either pseudocode or java), and describe your reasoning. Determine the Time complexity and if you cannot find any polynomial time algorithm, then give a backtracking algorithm. Problem will be on repeat numbers input will be ARRAY[1,2, ... , n] number of positive numbes. Output will any one number that is repeated more than n/3 times. for example, if you have [1,1,2,2,2,1], since n = 6 and n/3 = 2, both 1 and 2 showed up more than n/3 times. the output will be either 1 or 2 (just one of the values are required) if you have [1,1,3,4,5,6,7,8,9], since 1 is only repeated twice, and n/3 = 3, output will be "none"
Let A and B be two arrays of length n, each containing a random permutation of the numbers from 1 to n. An inversion between the two permutations A and B is a pair of values (x, y) where the index of x is less than the index of y in array A, but the index of x is more than the index of y in array B. Design an algorithm which counts the total number of inversions between A and B that runs in O(n log n) time.
You want to design an algorithm, called minMax(A,p,r), that takes an array of integers and indexes of the first and last elements, and returns the minimum and maximum values in that range. Now write the pseudo code of a divide and conquer (and therefore, recursive) algorithm with the same time complexity (Θ(n)). You can assume that p ≤ r. Also, in your code, you can return two numbers by returning a pair, e.g. “return (a, b)”, and can save the output in a similar way, e.g. “(a, b) = minMax(parameters)”. (Short answer please)
Write an efficient algorithm for the following problem, and describe your reasoning. Determine the Time complexity and if you cannot find any polynomial time algorithm, then give a backtracking algorithm. Problem: Binary Array Core Input: Two integers p and q and a binary array A[1...n], i.e., each entry contains either a 0 or 1. Output: Print Yes - if there exists a subarray A[i...k], where 1<= i < k <= n, with exactly p zeros in A[1...i-1] (there may be 1s) and exactly q ones in A[k+1...n] (there may be 0s). Print No - otherwise. Outputs with examples Input: A = [0,1,1,0,1], p = 2, q =1, Output: No. Input: A = [0, 1,1,0, 0,1,0,1], p = 1, q =1, Output: Yes because we can have A[1...i-1] = [0] and A[k+1 ... n] = [0,1,0,1]
1. Consider the algorithm for the sorting problem that sorts an array by counting,for each of its elements, the number of smaller elements and then uses thisinformation to put the element in its appropriate position in the sorted array:ALGORITHMComparisonCountingSort(A[0..n − 1])//Sorts an array by comparison counting//Input: Array A[0..n//Output: Array S[0..n− 1] of orderable values− 1] of A’s elements sorted// in nondecreasing orderfor i ← 0 to nCount− 1 do[i]←0for i ← 0 to n − 2 dofor j ← i +1 to n − 1 doif A[i] < A[j ]Count[j ]← Count[j ] + 1else Count[i]← Count[i] + 1for i ←0 to n−1 doS[Count[i]]←A[i]return Sa. Apply this algorithm to sorting the list 60, 35, 81, 98, 14, 47.b. Is this algorithm stable?c. Is it in-place?
For the program below, calculate its worst-case complexity as a function of the size n of the input array A. Explain your answer by giving a detailed calculation.def initialCommon (A,B): # initial common component of A, B for i in range (len(A) ,-1,-1): same = True for j in range (i): if A[j] != B[j]: same = False if same : return [A[j] for j in range (i)]
Suppose we have two arrays, a and b, containing numbers of size n and m, respectively. a and b array; All elements of a and b (only one copy of common elements) in another array c Write the adder program in C and calculate the number of steps and time complexity of the algorithm?
You have an array of n real numbers and another integer s. Find out whether the array contains two elements whose sum is s. (For example, for the array 5, 9, 1, 3 and s = 6, the answer is yes, but for the same array and s = 7, the answer is no.) Design an algorithm for this problem with a better than quadratic time efficiency.
In computer science and mathematics, the Josephus Problem (or Josephus permutation) is a theoretical problem. Following is the problem statement: There are n people standing in a circle waiting to be executed. The counting out begins at some point (rear) in the circle and proceeds around the circle in a fixed direction. In each step, a certain number (k) of people are skipped and the next person is executed. The elimination proceeds around the circle (which is becoming smaller and smaller as the executed people are removed), until only the last person remains, who is given freedom. Given the total number of persons n and a number k which indicates that k-1 persons are skipped and kth person is killed in circle. The task is to choose the place in the initial circle so that you are the last one remaining and so survive. For example, if n = 5 and k = 2, then the safe position is 3. Firstly, the person at position 2 is killed, then person at position 4 is killed, then person at position 1…
Given an array of positive and negative integers, write the main ideas of an algorithm to segregate them without changing the relative order of elements. The output should contain all positive numbers follow negative numbers while maintaining the same relative ordering. Example: Input: [9, -3, 5, -2, -8, -6, 1, 3] Output: [-3, -2, -8, -6, 9, 5, 1, 3] Determine the running time complexity of this algorithm