A numeric array of length N is given. We need to design a function that finds all positive numbers in the array. a) Describe approaches for solving optimal worst case and optimal average case performance, respectively.

A numeric array of length N is given. We need to design a function that finds all positive numbers in the array. a) Describe approaches for solving optimal worst case and optimal average case performance, respectively.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 18SA

See similar textbooks

Similar questions

We have N jobs and N workers to do these jobs. It is known at what cost each worker will do each job (as a positive numerical value). We want to assign jobs to workers in such a way that the total cost of completion of all jobs is minimal among other possible alternative assignments. For this problem, write the algorithm as pseudocode, whose input is a matrix representing worker/job costs, and the output is a list of tuples showing which work will be done by which worker, and that tries to reach the solution with GREEDY technique. Explain in what sense your algorithm exhibits greedy behavior. What is the time complexity of your algorithm? Interpret if your algorithm always produces the best (optimum) result for each instance of the problem.
The stock span problem is a financial problem where we have a series of n daily price quotes for a stock and we need to calculate the span of stocks price for all n days. The span S; of the stocks price on a given day i is defined as the maximum number of consecutive days just before the given day, for which the price of the stock on the current day is less than or equal to its price on the given day. For example, if an array of 7 days prices is given as {100, 80, 60, 70, 60, 75, 85}, then the span values for corresponding 7 days are {1, 1, 1, 2, 1, 4, 6}. Example 1: Input: N = 7, price[] Output: 1 1 1 2 1 4 6 = [100 80 60 70 60 75 85]
Consider array A of n numbers. We want to design a dynamic programming algorithm to find the maximum sum of consecutive numbers with at least one number. Clearly, if all numbers are positive, the maximum will be the sum of all the numbers. On the other hand, if all of them are negative, the maximum will be the largest negative number. The complexity of your dynamic programming algorithm must be O(n2). However, the running time of the most efficient algorithm is O(n). Design the most efficient algorithm you can and answer the following questions based on it. To get the full points you should design the O(n) algorithm. However, if you cannot do that, still answer the following questions based on your algorithm and you will get partial credit. Write the recursion that computes the optimal solution recursively based on the solu- (a) tion(s) to subproblem(s). Briefly explain how it computes the solution. Do not forget the base case(s) of your recursion.
There are n students who studied at a late-night study for final exam. The time has come to order pizzas. Each student has his own list of required toppings (e.g. mushroom, pepperoni, onions, garlic, sausage, etc). Everyone wants to eat at least half a pizza, and the topping of that pizza must be in his reqired list. A pizza may have only one topping. How to compute the minimum number of pizzas to order to make everyone happy?
A team sport game has m players in a team and a tournament can have n competing teams. TeamT1 ranks higher than team T2 if there is a way such that every member of T1 ranks higher than acorresponding member of T2 (note that the ranking is based on individual team members).(1) Design an efficient algorithm (pseudo code) to determine whether or not two teams T1and T2 can be ranked.(2) Given n teams {T1, T2, ... , Tn}, abstract the team ranking problem as a graph.(3) Design an efficient algorithm (pseudo code) to find the longest sequence <Ti1 , Ti2 ,..., Tik> of teams such that Tij ranks higher than Tij + 1 for j = 1,2,..., k − 1.(4) Analyze the time complexity of your algorithm in terms of m and n.
Question 2) We have N jobs and N workers to do these jobs. It is known at what cost each worker will do each job (as a positive numerical value). We want to assign jobs to workers in such a way that the total cost of completion of all jobs is minimal among other possible alternative assignments. For this problem, write the algorithm as pseudocode, whose input is a matrix representing worker/job costs, and the output is a list of tuples showing which work will be done by which worker, and that tries to reach the solution with GREEDY technique. Explain in what sense your algorithm exhibits greedy behavior. What is the time complexity of your algorithm? Interpret if your algorithm always produces the best (optimum) result for each instance of the problem.
Correct answer will be upvoted else downvoted. Computer science. Positive integer x is called divisor of positive integer y, in case y is distinguishable by x without remaining portion. For instance, 1 is a divisor of 7 and 3 isn't divisor of 8. We gave you an integer d and requested that you track down the littlest positive integer a, to such an extent that a has no less than 4 divisors; contrast between any two divisors of an is essentially d. Input The primary line contains a solitary integer t (1≤t≤3000) — the number of experiments. The primary line of each experiment contains a solitary integer d (1≤d≤10000). Output For each experiment print one integer a — the response for this experiment.
Given A = {1,2,3} and B={u,v}, determine. a. A X B b. B X B
Conserving water saves energy. In many regions water gets collected between the valleys which is used for various purposes by the villagers. Help villagers to estimate how much water can be possibly collected. Given N non-negative integers representing an elevation of valleys where the width of each valley is 1, compute total units of water it can hold after raining. 3 2 • Height = [0,1,0,2,1,0,1,3,2,1,2,1] • Output: 6 • Explanation: The above elevation map (black section) is represented by array [0,1,0,2,1,0,1,3,2,1,2,1]. In this case, 6 units of rain water (blue section) are being trapped. Input Format First line of input contains N, the number of valleys. Second line of input contains N integers denoting heights of the valley. Constraints • n == = height.length • 1 <= n <= 2 * 104 • 0 <= height[i] <= 105 Output Format Print a single line containing one positive integer, denoting the maximum amount of water that can be stored. Sample Input 0 12 0 1 0 2 1 0 1 3 2 1 2 1
This problem is taken from the delightful book "Problems for Mathematicians, Young and Old" by Paul R. Halmos. Suppose that 931 tennis players want to play an elimination tournament. That means: they pair up, at random, for each round; if the number of players before the round begins is odd, one of them, chosen at random, sits out that round. The winners of each round, and the odd one who sat it out (if there was an odd one), play in the next round, till, finally, there is only one winner, the champion. What is the total number of matches to be played altogether, in all the rounds of the tournament? Your answer: Hint: This is much simpler than you think. When you see the answer you will say "of course".
Single Point based Search: Fair share problem: Given a set of N positive integers S={x1, x2, x3,…, xk,… xN}, decide whether S can be partitioned into two sets S0 and S1 such that the sum of numbers in S0 equals to the sum of numbers in S1. This problem can be formulated as a minimisation problem using the objective function which takes the absolute value of the difference between the sum of elements in S0 and the sum of elements in S1. Assuming that such a partition is possible, then the minimum for a given problem instance would have an objective value of 0. A candidate solution can be represented using a binary array r=[b1, b2, b3,…, bk,… bN], where bk is a binary variable indicating which set the k-th number in S is partitioned into, that is, if bk =0, then the k-th number is partitioned in to S0, otherwise (which means bk =1) the k-th number is partitioned in to S1. For example, given the set with five integers S={4, 1, 2, 2, 1}, the solution [0,1,0,1,1] indicates that S is…
Today is Max's birthday. He has ordered a rectangular fruit cake which is divided into N x M pieces. Each piece of the cake contains a different fruit numbered from 1 to N*M. He has invited K friends, each of whom have brought a list of their favorite fruit choices. A friend goes home happy if the piece he receives is of his favorite fruit. Note that each friend can receive only one piece of cake. Design a way for Max to find the maximum number of friends he can make happy. Input The first line of the input consists of an integer - numOfFriends, representing the number of friends(k). The next Klines consist of X+1 space-separated integers, where the first integer represents the count of choices of the th friend followed by X space-separated integers representing the fruits he likes. The next line of the input consists of an integer - numN, representing the number of rows. The next line of the input consists of an integer - numM, representing the number of columns. Output Print an…