Array of positive numbers

Assignment Help Basic Computer Science

Reference no: EM13968061

1. The input is an N by N matrix of numbers that is already in memory. Each individ- ual row is increasing from left to right. Each individual column is increasing from top to bottom. Give an O(N) worst-case algorithm that decides if a number X is in the matrix.

2. Design ef?cient algorithms that take an array of positive numbers a, and determine:

a. the maximum value of a[j]+a[i], with j ≥ i.

b. the maximum value of a[j]-a[i], with j ≥ i.

c. the maximum value of a[j]*a[i], with j ≥ i.

d. the maximum value of a[j]/a[i], with j ≥ i.

Reference no: EM13968061

Questions Cloud

What is maximum load current il : What is maximum load current IL that can be drawn from the Zener regulator in Fig. if it is to maintain a regulated output? What is the minimum value of RI that can be used and still have a regulated output voltage?

Cubic maximum subsequence sum algorithm performs : The inner loop of the cubic maximum subsequence sum algorithm performs N(N+1)(N+2)/6 iterations of the innermost code. The quadratic version performs N(N + 1)/2 iterations.

?x the size of the longest word : 1. Why is it important to assume that integers in our computer model have a ?xed size? 2. Consider the word puzzle problem on page 2. Suppose we ?x the size of the longest word to be 10 characters.

Briefly describe the main point of the article. : What do you think could be driving the change in the skill sets employer's desire from their accountants?

Array of positive numbers : The input is an N by N matrix of numbers that is already in memory. Each individ- ual row is increasing from left to right. Each individual column is increasing from top to bottom. Give an O(N) worst-case algorithm that decides if a number X is in..

Worst-case running times : Programs A and B are analyzed and found to have worst-case running times no greater than 150N log2 N and N2, respectively. Answer the following questions, if possible:

State an existence theorem for the differential equation : State an existence theorem for the differential equation - Find y0, y1, y2 after converting it to an integral equation

Number of multiplications used by the fast exponentiation : Give a precise count on the number of multiplications used by the fast exponentiation routine. (Hint: Consider the binary representation of N.)

What are the major sources of revenue : State and local governments are accountable to much more than private investors. They are accountable to the community as a whole.

User Account

All Pages