GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Sign in
  • ActionsCI/CD and automation
  • CodespacesCloud development environments
  • All Features
  • Documentation
  • Training
  • Certifications
  • Build with Copilot
  • Customize Copilot
  • Integrations
  • Trending repos
  • GitHub Sponsors
  • Developer articles
  • Enterprises

This view

  • Original page
  • New address

GeezerVison is showing github.com — JavaProgramming/Array/MaximumMinimumNumber.java at main · karterhhgg/JavaProgramming

Expand file tree

/

MaximumMinimumNumber.java

Copy path
More file actions
More file actions

Latest commit

 

History

History
History
32 lines (26 loc) · 815 Bytes
/

MaximumMinimumNumber.java

Copy path

File metadata and controls

32 lines (26 loc) · 815 Bytes
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
//Find the maximum & minimum number in an array of integers.
package Array;
import java.util.*;
public class MaximumMinimumNumber {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int size = sc.nextInt();
int numbers[] = new int[size];
//input
for(int i=0; i<size; i++){
numbers[i] = sc.nextInt();
}
int max = Integer.MIN_VALUE;
int min = Integer.MAX_VALUE;
for(int i=0; i<numbers.length; i++){
if(numbers[i] < min){
min = numbers[i];
}
if(numbers[i] > max){
max = numbers[i];
}
}
System.out.println("Largest number is : "+ max);
System.out.println("Smallest number is :"+ min);
}
}
You are visitor 01402503 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.