Related questions

Need help in java algorithm for finding max and min

2018-11-08 07:30 May Sohatchevzzki imported from Stackoverflow

I need to write a java algorithm that receive 5 numbers from type int and print the max and min by using only 6 times with the Conditional Exchange:

If (x>y) {
    Int tmp = x;
    x=y;
    y=x;
}

The problem is that I only manage to do this algorithm with 7 conditional exchange and not 6. Can someone help me to understand what I'm missing? 

    Scanner myScanner = new Scanner(System.in);
    int a = myScanner.nextInt();
    int b = myScanner.nextInt();
    int c = myScanner.nextInt();
    int d = myScanner.nextInt();
    int e = myScanner.nextInt();

    if(a>b)
    {
        int tmp = b;
        b = a;
        a = tmp;
    }

    if(a>c)
    {
        int tmp = c;
        c = a;
        a = tmp;
    }

    if(a>d)
    {
        int tmp = d;
        d = a;
        a = tmp;
    }

    if(a>e)
    {
        int tmp = e;
        e = a;
        a = tmp;
    }

    if(b>e)
    {
        int tmp = e;
        e = b;
        b = tmp;
    }

    if(c>e)
    {
        int tmp = e;
        e = c;
        c = tmp;
    }

    if(d>e)
    {
        int tmp = e;
        e = d;
        d = tmp;
    }

    System.out.println(a);
    System.out.println(e);

5 answers

  • answered 2018-11-08 07:40 Khalid Shah

    There is a easy way of doing this. There is no need of swapping. If you want to find min and max by if/else then see my example otherwise you should use a array for this.

        Scanner myScanner = new Scanner(System.in);
    int a = myScanner.nextInt();
    int b = myScanner.nextInt();
    int c = myScanner.nextInt();
    int d = myScanner.nextInt();
    int e = myScanner.nextInt();
    int min = a,max=a;
    if(b<min){
         min=b;
    }
    if(c<min){
         min=c;
    }
    if(d<min){
         min=d;
    }
    if(e<min){
         min=e;
    }

    if(b>max){
         max=b;
    }
    if(c>max){
         max=c;
    }
    if(d>max){
         max=d;
    }
    if(e>max){
         max=e;
    }

    System.out.println(min);
    System.out.println(max);

  • answered 2018-11-08 07:47 Aravind Bhat K

    Put Every single element in an Array (arr1), And then import collections and Arrays

    import java.util.Arrays;
import java.util.Collections; 

int min = Collections.min(Arrays.asList(arr1));  // arr1 will be your array
int max = Collections.max(Arrays.asList(arr1));

  • answered 2018-11-08 08:08 Andy Turner

    Think about it like a merge sort: break the problem down to finding the min and max for pairs of numbers; then for pairs of pairs etc.

    if (a >= b) swap(a, b); // logically swap them; you can't actually write a method to do this.

    Now a = min(a, b) and b = max(a, b).

    if (c >= d) swap(c, d);

    Now c = min(c, d) and d = max(c, d).

    if (a >= c) swap(a, c);
if (b >= d) swap(b, d);

    Now a = min(a, b, c, d) and d = max(a, b, c, d).

    Then it's just a matter of handling e:

    if (a >= e) swap(a, e);
if (d >= e) swap(d, e);

    The min is in a; the max is in e.

  • answered 2018-11-08 08:14 raven1981

    Comparing two pairs first, then you can save a comparison knowing than the first pair smaller must be compared with the second pair smaller and the first pair bigger must be compared with the second pair bigger. We have a number left that must be compared with the current smaller and bigger in case it fits there.

    Implementation:

    Scanner myScanner = new Scanner(System.in);
int a = myScanner.nextInt();
int b = myScanner.nextInt();
int c = myScanner.nextInt();
int d = myScanner.nextInt();
int e = myScanner.nextInt();

myScanner.close();

// First pair
if(a>e)
{
    int tmp = e;
    e = a;
    a = tmp;
}

// Second pair
if(c>d)
{
    int tmp = d;
    d = c;
    c = tmp;
}

// Smaller
if(a>c) {
    int tmp = a;
    a = c;
    c = tmp;
}

// Bigger
if(d>e) {
    int tmp = d;
    d = e;
    e = tmp;
}

// Remaining value bigger
if(b>e) {
    int tmp = b;
    b = e;
    e = tmp;
}

// Remaining value smaller     
if(a>b) {
    int tmp = b;
    b = a;
    a = tmp;
}



System.out.println(a);
System.out.println(e);

  • answered 2018-11-08 08:36 MrCode

    // Compare your numbers in pairs, I've paired up a-b and c-d and e will be compared separately 

    Scanner myScanner = new Scanner(System.in);

int a = myScanner.nextInt();
int b = myScanner.nextInt();
int c = myScanner.nextInt();
int d = myScanner.nextInt();
int e = myScanner.nextInt(); 

int min ; int max ;
int min1 = a, max1 = b;
int min2 = c, max2 = d ; 

if(a > b ){
      min1 = b ;
      max1 = a ;
      // Here I set original min and max to min1 and max2 to save extra conditionals
      min = min1 ; 
      max = max1 ;  
}

if(c > d ){
      min2 = b ;
      max2 = a ; 
}

if(min1 > min2)
      min = min2 ; 
if(max2 > max1)
      max = max2 ;

// One last comparison for e and we've found what were looking for :)
if( e > max){ 
      max = e ; }
if( e < min){
      min = e ; }

See also questions close to this topic

  • How to make a post call in play framework with request data as multipart data using WsClient. I have to send a file and other strings in the request?

    I am trying this but its not working.I have to make a post call with multipart form data.

        ByteArrayOutputStream bos = new ByteArrayOutputStream();
    F.Promise<WSResponse> wsresponse = null;
    List<Part> parts = new ArrayList<>();
    parts.add(new com.ning.http.multipart.FilePart("file", file,"" , null));
    parts.add(new StringPart("saleId", saleId));
    parts.add(new StringPart("tag", documentTag));
    Part[] partsA = parts.toArray(new Part[parts.size()]);
              // Add it to the multipart request entity
              MultipartRequestEntity requestEntity = new MultipartRequestEntity(partsA, new FluentCaseInsensitiveStringsMap());
              try {
                requestEntity.writeRequest(bos);
            } catch (IOException e1) {
                // TODO Auto-generated catch block
                e1.printStackTrace();
            }
    InputStream reqIS = new ByteArrayInputStream(bos.toByteArray());
    wsresponse = WS.url(platformFileUploadURL).setContentType(requestEntity.getContentType()).post(reqIS);
    _
  • Exclude file from jar using Gradle

    I have a built a springboot jar, and I want to exclude all logback.xml from fatjar using gradle. and I have tried in following way.

    jar{
    exclude '/BOOT-INF/lib/**/logback.xml'
}

    Could some one please help me how to exclude all logback.xml from dependencies using gradle.

  • Google Cloud HSM as a provider for encryption

    AWS seems to allow us to have the AWS Cloud HSM as a provider, See here and here

    Security.addProvider(new com.cavium.provider.CaviumProvider())

    In the samples from GKE however we seem to only have bouncy castle as a provider. See here

    Security.addProvider(new BouncyCastleProvider());

    Maybe i am missing something fundamental here

  • Preventing users from creating multiple accounts based on different parameters

    I have a situation where I have a known bug in the system but it cannot be fixed until the the API provider makes some changes to their API in order to prevent that bug.

    Now my question here is:

    Is there any way in order to know whether one user (based on IP or something like that) to know with 99% certainty that it is the same user creating a different account?

    I'm guessing that this can be done by IP, OS detection... But I'm not too sure if there are any algorithms out there that can be used for this kind of detection?

    What kind of parameters and algorithms can be used for this kind of problem?

    Can someone help me out?

  • User-based collaborative filtering recommender system computation

    I'm trying to implement a simple recommender system for a gallery/photo website which has around 30000 monthly active users, using user-based collaborative filtering.

    I am specifically following steps from this wikipedia article: https://en.wikipedia.org/wiki/Collaborative_filtering#Memory-based

    and I'm having trouble with calculating this:

    the set of top 'N' users that are most similar to user 'u'

    In order to find top 'N', first I have to calculate similarity for each pair of users.

    I'm having trouble calculating similarity between users since there are about 450 million user pairs (30000 choose 2) and it takes about 0.1 seconds to calculate similarity for each pair (in SQL). I am calculating similarity based on the number of the same galleries that both users visited.

    Am I supposed to precalculate similarities for all 450 millions of user pairs or is there a different approach to this?

    I've seen some Python libraries made for this but I'm having doubts about how much faster they'd get the job done.

  • How to calculate shortest path between multiple pick and drop destinations

    I have a scenario where I have multiple robots, say 2 in this case and they have to pick and drop some items at specified locations as shown in Figure.

    There are two jobs to be done 1) pick up an object from A and drop at B 2) pick up an object from C and drop at D The possible routes are

    A->B-C->D

    A->C->B->D

    A->C->D->B

    C->D->A->B

    C->A->D->B

    C->A->B->D

    I am a beginner in path planning and am finding it difficult to come up with a solution that can work in this case. I can use dikstra and A* etc to find all possible paths but in my case I have a constraint that the destination node cant be reached if the source node for that particular destination node hasnt been visited first.