recursive seqeuntial search java code

Question

1.00/5 (1 vote)

See more:

C++

public int seqSearch(T[] list, int length, T searchItem)
{
    int loc; 
    boolean found = false;
    for(loc = 0; loc < length; loc++)
    {
        if(list[loc].equals(searchItem))
        {
           found = true;
           break; 
        }
    }

    if(found)
        return loc;
    else
        return-1;
}

Posted 15-May-12 12:52pm

loloa

Updated 15-May-12 13:04pm

TRK3

v3

Add a Solution

Comments

TRK3 15-May-12 19:05pm

Fixed formatting and code tags.

What's your question?

Sergey Alexandrovich Kryukov 15-May-12 20:00pm

So, Java or C++? Tag it properly.
And where is the question?
--SA

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)

OriginalGriff · Answer 1 · 2012-05-15T19:30:00

We do not do your homework: it is set for a reason. It is there so that you think about what you have been told, and try to understand it. It is also there so that your tutor can identify areas where you are weak, and focus more attention on remedial action.

Try it yourself, you may find it is not as difficult as you think!

You might also want to get together with the rest of your class - one of them is here: recursive sequential search[^]