How do I write an algorithm in recursive form and show its running time

Question

1.00/5 (2 votes)

See more:

Hello,

I am asked to write in pseudocode a Θ(n)-time algorithm in recursive form that, given a set S of
n integers, determines which two elements in S have the largest sum.

Can anyone help me with this problem and explain how you can show the actual running time by solving the recurrence ?

Thank you

What I have tried:

I am able to write an algorithm if the set is sorted, but I am not allowed to use a sorted array as this would be Θ(n log n)-time

Posted 14-Mar-16 6:02am

Member 12391208

Updated 14-Mar-16 6:56am

Add a Solution

Comments

Dave Kreskowiak 14-Mar-16 12:28pm

You're going to have to show the code you've written. Nobody is going to do the work for you.

Matt T Heffron 14-Mar-16 13:18pm

Isn't that just the two largest elements?
That should be trivial.

1 solution

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Mehdi Gholam · Accepted Answer · 2016-03-14T06:56:00

Solution 1

O(n) means you will go through each element, so if you have 10 elements you will go through all 10 elements once to get your results.

With that comment you should be able to do your homework.

Posted 14-Mar-16 6:56am

Mehdi Gholam