Sem 4 AOAD : Java Code / Program for MAXMIN algorithm

Given below is the java code for MAXMIN concept.

import java.util.*; class Stack { int top; int s[]=new int[50]; Stack() { top=-1; } void push(int n) { s[++top]=n; } int pop() { return s[top--]; } void display() { for(int i=0;i<=top;++i) System.out.print(" "+s[i]); } } class MAXMIN2 { static int a[]; static int i,j,max,min; static int flag=0; Scanner scr=new Scanner(System.in); MAXMIN2() { System.out.println("Enter number of elements in array"); int n=scr.nextInt(); a=new int[n]; System.out.println("Enter the elements"); for(int i=0;i<n;++i) a[i]=scr.nextInt(); } Stack s1=new Stack(); Stack s2=new Stack(); void max_min(int i,int j) { if(i==j) { //if(flag==0) //{ max=a[j]; min=a[i]; s1.push(max); s2.push(min); //} /*else { nmax=a[j]; nmin=a[i]; } */ } else if(i==(j-1)) { //if(flag==0) //{ min=(a[i]<a[j])?a[i]:a[j]; max=(a[i]>a[j])?a[i]:a[j]; s1.push(max); s2.push(min); //} /*else { nmin=(a[i]<a[j])?a[i]:a[j]; nmax=(a[i]>a[j])?a[i]:a[j]; } */ } else { int m=(i+j)/2; max_min(i,m); max_min(m+1,j); int lmax,lmin,rmax,rmin; rmax=s1.pop(); rmin=s2.pop(); lmax=s1.pop(); lmin=s2.pop(); if(rmax>lmax) s1.push(rmax); else s1.push(lmax); if(rmin<lmin) s2.push(rmin); else s2.push(lmin); } } void display1() { int low=s2.pop(); int high=s1.pop(); System.out.println("max value in the array is= "+high+" min value in the array= "+low); } } class MainMAXMIN { public static void main(String args[]) { Scanner scr=new Scanner(System.in); System.out.println("Please enter the length of array"); int l=scr.nextInt(); MAXMIN2 m=new MAXMIN2(); m.max_min(0,(l-1)); m.display1(); /* System.out.println("max value in the array is= "++" min value in the array= "+min); System.out.println("max value in the array is= "+max+" min value in the array= "+min);*/ } }