Answers for "find minimum in array java"

Find minimum and maximum values in a java array

// Find minimum and maximum values in a java array
public class MaxMinValueInArray
{
   public static void main(String[] args) 
   {
      int[] arrNumber = new int[]{50, 150, 250, 500, 160, 530};
      int maximum = maxNumber(arrNumber);
      System.out.println("Maximum value : " + maximum);
      // calling min function java
      int minimum = minNumber(arrNumber);
      System.out.println("Minimum value : " + minimum);
   }
   // java find max in array
   public static int maxNumber(int[] arr)
   {
      int maximumValue = arr[0];
      for(int a = 1; a < arr.length; a++)
      {
         if(arr[a] > maximumValue)
         {
            maximumValue = arr[a];
         }
      }
      return maximumValue;
   }
   // java min of array
   public static int minNumber(int[] arr)
   {
      int minimumValue = arr[0];
      // find minimum value in array java
      for(int a = 1; a < arr.length; a++)
      {
         if(arr[a] < minimumValue)
         {
            minimumValue = arr[a];
         }
      }
      return minimumValue;
   }
}

find min in array java

private static int findMin(int[] array) {
		int min = array[0];
		for(int i=1;i<array.length;i++) {
			if(min > array[i]) {
				min = array[i];
			}
		}
		return min;
	}

min array number in java

Integer[] num = { 2, 4, 7, 5, 9 };
        // using Collections.min() to find minimum element
        // using only 1 line.
        int min1 = Collections.min(Arrays.asList(num));

        // using Collections.max() to find maximum element
        // using only 1 line.
        int max1 = Collections.max(Arrays.asList(num));
        System.out.println(min1); // 2 
        System.out.println(max1); // 9

minimum and maximum values in a bst java

int max(Node t) { 
    	        	if(t == null)
    	        		return 0;
    	            while (t.right != null)  
    	                t = t.right; 
    	             System.out.println(t.data); 
    	            return t.data; 
    	        }
    	        //Node max(Node t) {
    	        	 // if (t.right != null) { 
      	               // return min(t.right);
      	            //} 
      	            //return t;
    	        //}
    	        int min(Node t) {
    	        	if(t == null)
    	        		return 0;
    	            while (t.left != null)  
    	                t = t.left; 
    	             System.out.println(t.data); 
    	            return t.data; 
    	        }
    	        //Node min(Node t) { 
    	          //  if (t.left != null) { 
    	            //    return min(t.left);
    	            //} 
    	            //return t; 
    	        //}