Find top two highest numbers in a array java


  • Hi Friends today we will discuss about how to find top two maximum numbers in an array using java program.
  • For this we have written separate function to perform logic
  • findTwoMaxNumbers method takes integer  array as an argument
  • Initially take two variables to find top to numbers and assign to zero.
  • By using for each loop iterating array and compare current value with these values
  • If our value is less than current array value then assign current value to max1 
  • And assign maxone to maxtwo because maxtwo should be second highest.
  • After completion of all iterations maxone will have top value and maxtwo will have second maximum value.
  • Print first maximum and second maximum values.
  • So from main method create array and pass to findTwoMaxNumbers(int [] ar)



package com.javainhouse;


public class FindTopTwo { public void findTwoMaxNumbers(int[] array){ int maxOne = 0; int maxTwo = 0; for(int i:array){ if(maxOne < i){ maxTwo = maxOne; maxOne =i; } else if(maxTwo < i){ maxTwo = i; } } System.out.println("First Maximum Number: "+maxOne); System.out.println("Second Maximum Number: "+maxTwo); } public static void main(String a[]){ int num[] = {4,23,67,1,76,1,98,13}; FindTopTwo obj = new FindTopTwo(); obj.findTwoMaxNumbers(num); obj.findTwoMaxNumbers(new int[]{4,5,6,90,1}); }

Output:




First Maximum Number: 98
Second Maximum Number: 76
First Maximum Number: 90
Second Maximum Number: 6

Equilibrium index of an array

Equilibrium index of an array is an index such that the sum of elements on whose left is equal to sum of elements on right  in java . For example, in an array A:

A[0] = -7, A[1] = 1, A[2] = 5, A[3] = 2, A[4] = -4, A[5] = 3, A[6]=0

3 is an equilibrium index, because:
A[0] + A[1] + A[2] = A[4] + A[5] + A[6]

6 is also an equilibrium index, because sum of zero elements is zero, i.e., A[0] + A[1] + A[2] + A[3] + A[4] + A[5]=0

7 is not an equilibrium index, because it is not a valid index of array A.




 public class EquilibriumJavaInHouse
{

public static void main(String[] args) 
    {
int arr[]={-5, 2, 4, 2, -4, 7, -4};
        int i, j;
        int leftsum, rightsum;
        int count=0;
 
          
         int arraylength=arr.length;
        for (i = 0; i < arraylength; ++i) 
        {
            leftsum = 0;  
            rightsum = 0; 
            
            for (j = 0; j < i; j++)
                leftsum += arr[j];
           
            for (j = i + 1; j < arraylength; j++)
                rightsum += arr[j];
           
            if (leftsum == rightsum)
            {
              System.out.println("Equilibirium found at"+i);
              count++;
            }
                
        }
        if(count==0)
        System.out.println("No Equilibirium found ");
        }

}

OutPut:

Equilibrium index of an array