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 LifeisBeautiful

    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 log incoming request in spring MVC

    I have a JSON request body like this 

    {  
   "3DSecure":{  
      "paRes":"xxxxxxxxxxxxxxxxxxxxxxx"
   }
}

    I developed endpoint to log that request. 

    @RequestMapping(value = "/logging/requests", method = RequestMethod.POST)
@ResponseBody
public String loggingIncomingRequest(@RequestBody AxiPayCargilsRequest request,
                                         HttpServletRequest servletRequest,
                                         ServiceContext serviceContext){

    log.info("!--REQUEST START--!"+request);

    log.info("");
    return null;
}

    How to log this request can anyone help me from the level of Object creation Thanks.

  • Problems in office 365 integration with graph API using Java SDK

    I have been following https://github.com/microsoftgraph/msgraph-sdk-java project for getting all the mails using Microsoft Graph API. This project works fine based on my changed configuration.

    However, this follows OAuth authentication and I have to configure redirect url, and while running project, I got authentication code as query param on given url.

    I stuck at two points :

    1. How to by pass redirect_url concept, since my application is going to run in background. so, is there any way, I can auto capture this authentication code?

    2. By trading authentication code, I receive access_token having 3600 expiry using below method. 

      OAuth2AccessToken mAccessToken = mOAuthService.getAccessToken(authCodeFromURL);

    In above object, receiving below JSON, which does not have refresh token.

    {
    "token_type": "Bearer",
    "scope": "Files.ReadWrite openid User.Read Mail.Send Mail.ReadWrite",
    "expires_in": 3600,
    "ext_expires_in": 3600,
    "access_token": "encryptedCode",
    "id_token": "encryptedCode"
}

    I have tried to get the new access token with below method from SDK by using id_token, but it is not working, gives me invalid.

    OAuth2AccessToken mAccessToken = mOAuthService.refreshAccessToken(idToken);

    Invalid JSON :

    {
    "error": "invalid_grant",
    "error_description": "AADSTS9002313: Invalid request. Request is malformed or invalid.\r\nTrace ID: 03690b71-4056\r\nCorrelation ID: b70a7b7b-963b-4cd6\r\nTimestamp: 2019-05-22 08:24:33Z",
    "error_codes": [9002313],
    "timestamp": "2019-05-22 08:24:33Z",
    "trace_id": "03690b71-4056-49b9",
    "correlation_id": "b70a7b7b-963b-4cd6"
}

    What is id_token?

    How can I refresh this access_token? Or Is there any other way/method to do it?

  • Array Manipulation : HackerRank Questions : JAVA

    I am doing this Array Manipulation problem from hackerrank and it tells me compile error is Terminated due to timeout.

    For small arrays my method work perfectly. This error only happens for bigger array values.

    Here is the question link. Question Here

    Starting with a 1-indexed array of zeros and a list of operations, for each operation add a value to each of the array element between two given indices, inclusive. Once all operations have been performed, return the maximum value in your array.

    For example, the length of your array of zeros . Your list of queries is as follows:

    a b k
1 5 3
4 8 7
6 9 1

    Add the values of between the indices and inclusive:

    index -> 1 2 3  4  5 6 7 8 9 10
        [0,0,0, 0, 0,0,0,0,0, 0]
        [3,3,3, 3, 3,0,0,0,0, 0]
        [3,3,3,10,10,7,7,7,0, 0]
        [3,3,3,10,10,8,8,8,1, 0]

    The largest value is after all operations are performed.

    Given below is my method.

     static long arrayManipulation(int n, int[][] queries) {
    long max = 0L;
    long[] arr = new long[n];
    for (int i = 0; i < n; i++) {
        arr[i] = 0L;
    }
    for (int i = 0; i < queries.length; i++) {
        int[] q = queries[i];
        int start = q[0] - 1;
        int end = q[1] - 1;
        int val = q[2];
        long tempMax = updateVal(start, end, val, arr);
        if (tempMax > max) {
           max = tempMax;
        }
    }
    return max;
 }



static long updateVal(int start, int end, int val, long[] arr) {
   long max = 0L;
   for (int i = start; i <= end; i++) {
       arr[i] = arr[i] + val;
       if (arr[i] > max) {
           max = arr[i];
       }
   }
   return max;
}

    Given below are few test classes that doesn't work with my code.
    Test1 Test2 Test3

    Please help me to figure this out. I searched for lots of answers based on java.
    But I couldn't understand them.
    This is my last resort. Please help.

  • Procedural algorithm to determine which math operation should be performed last

    I'm building a procedural algorithm to determine which operation to perform last in a mathematical formula.

    For context, I have written a token parser and a small interpreter, using VBA for Microsoft Excel.
    But this is a generic algorithm question, so I'm happy to communicate in whichever language you prefer.

    For the purposes of this algorithm, my interpreter only needs to support parentheses, multiplication and division. (Let's not complicate things with too many operators for the time-being.)

    My token parser is already working, so we have an array of token objects to work with.

    Therefore, we can pass an array of token objects as input to the interpreter, and the interpreter should be able to determine which operations are being performed, simplify the expression, reduce the fraction, etc.
    For example, if we pass this array of tokens: x*y/x*z
    ... ultimately my interpreter would be able to reduce the fraction to y/z since the x's cancel out, and since multiplication takes precedence over division.

    However, I need to support parentheses to make this practical for a specific end-user application.
    Things get complicated when you include parentheses ...
    For example: a/(b*c/(d*e/f)*g/h)/i*(j/k) what a mess! XD

    Recursion to the rescue!

    We can greatly simplify this problem by splitting it into smaller problems.
    Since multiplication takes precedence, we can split this into two sections:
    a/(b*c/(d*e/f)*g/h) / i*(j/k)
    ... and then recursively invoke my interpreter (function) on each of those two sections individually, which would then break them down into even smaller sections, until eventually the problem is simple enough to compute with ease. (Base case = no division operators left)

    My interpreter is mostly complete, the only thing that is missing is the ability to determine where to split the array of tokens.
    In other words, I need to build an algorithm that can look at the placement of operators and parentheses, and figure out which operation occurs last, so I can split the token array in half.

    Given a sequential array of token objects, I have written some helper functions to produce sequential arrays of integers, representing the indexes of parentheses, multiplication operators, and division operators.

    Dim tokenCount As Long  'Total number of tokens in the current input array

Dim openParenIndexes()      As Long  'Arrays of integers, representing token positions
Dim closeParenIndexes()     As Long
Dim multiplicationIndexes() As Long
Dim divisionIndexes()       As Long

    In the above example (using zero-based indexing):
    openParenIndexes = [2, 7, 22]
    closeParenIndexes = [13, 18, 26]
    multiplicationIndexes = [4, 9, 14, 21]
    divisionIndexes = [1, 6, 11, 16, 19, 24]

    Again, these arrays are already populated and ready to use.
    My program needs to be able to look at the information in these arrays, and figure out that the division operator at index 19 is the final operator to be computed, and therefore the array of tokens should be split at that index.

    Using this information, what's the best way to begin creating this algorithm?
    Should this also be a recursive algorithm?

    I presume more recursion could possibly make this easier, but I'm having trouble figuring out where to start.

  • Implementing Floyd-Warshall in Java

    I'm trying to implement the Floyd-Warshall algorithm and I'm a bit stuck on how to go about it.

    I'm taking in an unspecified amount of weighted edges, the input is 3 integers: the source, destination and weight. Example:

    1 9 4

    1 is source node, 9 is destination node and 4 is weight.

    Here is my code below:

    import java.util.*;

public class FloydWarshall {

  public static void main(String[] args) {
    Scanner stdin = new Scanner(System.in);
    ArrayList<ArrayList<Integer>> list = new ArrayList<ArrayList<Integer>>();
    ArrayList<Edge> edges = new ArrayList<Edge>();
    while(stdin.hasNext()) {
      String[] str = stdin.nextLine().split("[\\s,]+");
      ArrayList<Integer> inner = new ArrayList<Integer>();
      for(int i = 0; i < str.length; i++) {
        inner.add(Integer.parseInt(str[i]));
      }
      list.add(inner);
    }
    Graph graph = new Graph(edges.size());
    for(int i = 0; i < list.size(); i++) {
      graph.addEdge(edges, list.get(i).get(0), list.get(i).get(1), list.get(i).get(2));
    }
  }
}

class Edge {
  int source;
  int destination;
  int weight;

  public Edge(int source, int destination, int weight) {
    this.source = source;
    this.destination = destination;
    this.weight = weight;
  }
}

class Graph {
  int vertices;
  int adjMatrix[][];

  public Graph(int vertices) {
    this.vertices = vertices;
    this.adjMatrix = new int[vertices][vertices];
  }
  public void addEdge(ArrayList<Edge> edges, int source, int destination, int weight) {
    Edge edge = new Edge(source, destination, weight);
    edges.add(edge);
    adjMatrix[source][destination] = weight;
  }
}

    I'm trying to implement an adjacency matrix for the Floyd-Warshall algorithm but I'm having trouble implementing it, I've never used an adjacency matrix so any help would be appreciated!

  • How should i guarantee consistency in database involving finance transaction operations

    I am trying to figure out how to handle consistency in the database. In scenario:

    • User A has an accounting document in the database include a balance field representing the amount of his current money. (supposed initially he has 100$)

    • My system has many methods to charge his account.

    • Suppose 2 methods occur at the same time, each method charges him for 10$, these steps occur concurrently in below orders:
      • Method 1 READ his balance and store in memory (100$)
      • Method 2 READ his balance and store in memory (100$) ... some business logics
      • Method 1 UPDATE his balance by subtracting variable in memory by 10 (100$ - 10$) and then save it
      • Method 2 UPDATE his balance by subtracting variable in memory by 10 (100$ - 10$) and then save it

    This means he has been charged only 10$ instead of 20$.

    I searched this situation a while and can not get it clear (sorry for my stupidity). Really appreciate yours helps to enlighten my featherbrained. :)