Analyze running time of algorithm

Assignment Help Computer Engineering

Reference no: EM132998

Question

Suppose you have an array of numbers, where each value occurs at most twice.

We consider sums of contiguous numbers in array. But we only consider such sums whose two endpoints have the similar value. The sum includes the 2 equal values themselves. So if the two equal numbers are at index i and index j (i < j) in array A, then we sum all the values A[i],A[i + 1], . . . ,A[j].

(a) Give an algorithm that finds maximum such sum. Make your algorithm as efficient as possible. Explain the algorithm briefly in English and in psuedo code.

(b) Analyze running time of your algorithm.

Reference no: EM132998

Questions Cloud

Prepare a computer credit memo : Prepare a computer credit memo that reduces the customer's account balance by the same amount

How to utilize data mining tools and techniques : How to utilize data mining tools and techniques

Discuss the importance of organisational culture : Discuss the importance of organisational culture for effective organisational performance. Support your answer with relevant industry examples

Classify traditional grade school algorithms : Classify traditional grade school algorithms

Analyze running time of algorithm : Analyze running time of algorithm

Explain briefly how electronic money works : Explain briefly how electronic money works. Give two benefits of e-money to each of the following-

What is compensation of using rule sets : What is compensation of using rule sets

What are the roles of the management sponsors : What are the roles of the management sponsors

Illustrate the constraint graph : Illustrate the constraint graph

User Account

All Pages