A program that will ask the user how many element to be process in array and then the program will determine which of the given number in minimum and maximum number using Java programming language.
I am currently accepting programming work, IT projects, school and application development, programming projects, thesis and capstone projects, IT consulting work, computer tutorials, and web development work kindly contact me in the following email address for further details. If you want to advertise on my website kindly contact me also in my email address also. Thank you.
My email address is the following jakerpomperada@gmail.com, jakerpomperada@aol.com, and jakerpomperada@yahoo.com.
My mobile number here in the Philippines is 09173084360.
My telephone number at home here in Bacolod City, Negros Occidental Philippines is +63 (034) 4335675.
Here in Bacolod City I also accepting computer repair, networking and Arduino Project development at a very affordable price.
Program Listing
/**
* @author Jake Rodriguez Pomperada,MAED-IT, MIT
* www.jakerpomperada.com / www.jakerpomperada.blogspot.com
* jakerpomperada@gmail.com
* Bacolod City, Negros Occidental Philippines
*/
import java.util.Scanner;
public class Minimum_Maximum_Numbers {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner in = new Scanner(System.in);
int n=0, sum = 0;
int min=0, max=0;
System.out.println("\n");
System.out.print("\tMinimum and Maximum Number in Java");
System.out.println("\n");
System.out.print("\tEnter no. of elements you want in array:");
n = in.nextInt();
int a[] = new int[n];
for(int i = 0; i < n; i++)
{
System.out.print("\tGive element "
+ " value no." + (i+1) + " : ");
a[i] = in.nextInt();
}
min = max = a[0];
for(int i=1; i < n; i++) {
if(a[i] < min) min = a[i];
if(a[i] > max) max = a[i];
}
System.out.println();
System.out.println("\tMinimum Number : " + min +"." );
System.out.println("\tMaximum Number : " + max +"." );
System.out.println();
System.out.println("\tEnd of Program");
System.out.println("\n");
}
}
No comments:
Post a Comment