Finding the smallest and second smallest value in an array Java

Question

I'm trying to create two method one that finds the smallest and one that finds the second smallest value in an Array of objects.

I've written the two like this

public static BanffMarathonRunner getFastestTime(BanffMarathonRunner[] runner){
    if(runner.length == 0){
        return null;
    }
    BanffMarathonRunner fastest = runner[0];
    for(int i = 0; i< runner.length; i++){
        BanffMarathonRunner now = runner[i];
        if(now.Time < fastest.Time){
            fastest = now;

        }
    }
    return fastest;
}
    public static BanffMarathonRunner getSecondFastestTime(BanffMarathonRunner[] runner){
        if(runner.length == 0){
            return null;
        }
        BanffMarathonRunner fastest = runner[0];
        BanffMarathonRunner secondFastest = runner[0];
        for(int i = 0; i< runner.length; i++){
            BanffMarathonRunner now = runner[i];
            if(now.Time < fastest.Time){
                fastest = now;
        for(int j = 0; j< runner.length; j++){
            BanffMarathonRunner now2 = runner[j];
            if(now2.Time < secondFastest.Time){

                secondFastest = now2;
                if(now2.Time == fastest.Time){
                    secondFastest = secondFastest;
                }
            }
        }

            }
        }
        return secondFastest;
    }

I've figured out the how to find the smallest value, I just need to find the second smallest and I'm not sure how.

Any Ideas? Thanks!

Why not remove the fastest from the array and then run your function to find the fastest one from the times that are left? — APerson
– APerson, Commented Oct 22, 2014 at 2:58

Srinivasu · Accepted Answer · 2014-10-22 03:26:30Z

1

Arrays.sort(test);
   if(test.length-2 >= 0)
       System.out.println(test[test.length-2]);

edited Oct 22, 2014 at 3:26

answered Oct 22, 2014 at 3:11

Srinivasu

1,23515 silver badges35 bronze badges

Sign up to request clarification or add additional context in comments.

Comments

Andrew Luo · Accepted Answer · 2014-10-22 14:25:18Z

0

something like this:

findSecondSmallest anArray[]:
    if anArray.length < 2:
        return null;
    fastest = anArray[0];
    secondFastest = anArray[1];
    if fastest > secondFastest:
        fastest = anArray[1];
        secondFastest = anArray[0]
    for each element in anArray:
        if element < fastest:
            secondFastest = fastest;
            fastest = element;
        else if element < secondFastest:
            secondFastest = element;

    return secondFastest

edited Oct 22, 2014 at 14:25

answered Oct 22, 2014 at 3:07

Andrew Luo

9271 gold badge5 silver badges6 bronze badges

3 Comments

Andrew Luo Over a year ago

Please mark my answer as correct with the green check, thanks!

Koray Tugay Over a year ago

This is not even Java syntax.

Andrew Luo Over a year ago

it's just pseudocode, the question was more of an algorithmic one.

Community · Accepted Answer · 2017-05-23 12:20:29Z

0

Once you know the fastest runner, store the index of this entry. Then when finding the 2nd fastest runner, ignore the index of Fastest runner in the loop using 'continue'

Also for any K-smallest entry, you can see the idea given on this question: K smallest in Array Java

edited May 23, 2017 at 12:20

CommunityBot

11 silver badge

answered Oct 22, 2014 at 3:04

Wajahat

1,6434 gold badges21 silver badges49 bronze badges

Collectives™ on Stack Overflow

Finding the smallest and second smallest value in an array Java

3 Answers 3

Comments

3 Comments

Comments

Your Answer

Linked

Hot Network Questions

Collectives™ on Stack Overflow

3 Answers 3

Comments

3 Comments

Comments

Your Answer

Sign up or log in

Post as a guest

Linked

Related