Skip to main content

Largest and smallest number from array in java

//File name--> MinMax.java
import java.io.*;
class MinMax{
 public static void main(String args[])throws Exception
 {
  BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
  int n,min=0,max=0;
  
  System.out.println("Enter number of element you want in array.");
  n=Integer.parseInt(br.readLine());
  int[] a=new int[n];
  
  for(int i=0;i < n;i++)
  {
   System.out.println("Enter elementa["+i+"]:");
   a[i]=Integer.parseInt(br.readLine());
  }
  min=max=a[0];
  System.out.print("Content of Array:");
  for(int i=0;i < n;i++)
  {
   System.out.print("\t"+a[i]);
   
   if(min>a[i])
    min=a[i];
    
   if(max < a[i])
    max=a[i];
  }
  System.out.println("\nLargest element from array is:"+max);
  System.out.println("Smallest element from array is:"+min);
 }
}

OUTPUT

javac MinMax.java

java MinMax
Enter number of element you want in array.
10
Enter elementa[0]:
-5
Enter elementa[1]:
11
Enter elementa[2]:
88
Enter elementa[3]:
77
Enter elementa[4]:
66
Enter elementa[5]:
55
Enter elementa[6]:
44
Enter elementa[7]:
33
Enter elementa[8]:
22
Enter elementa[9]:
11
Content of Array:       -5      11      88      77      66      55      44
33      22      11
Largest element from array is:88
Smallest element from array is:-5


Comments

  1. How to play on the sands casino - Shootercasino.com
    The main difference between a 샌즈카지노 slot machine and a video poker is that most of the slot machines, except 온카지노 for a few, 12bet have games like

    ReplyDelete

Post a Comment

Popular posts from this blog

MVT (Multiprogramming Variable Task) in C Programming

#include< stdio.h> #include< conio.h> void main() { int i,os_m,nPage,total,pg[25]; clrscr(); printf("\nEnter total memory size:"); scanf("%d",&total); printf("\nEnter memory for OS:"); scanf("%d",&os_m); printf("\nEnter no. of pages:"); scanf("%d",&nPage); for(i=0;i< nPage;i++) { printf("Enter size of page[%d]:",i+1); scanf("%d",&pg[i]); } total=total-os_m; for(i=0;i< nPage;i++) { if(total>=pg[i]) { printf("\n Allocate page %d",i+1); total=total-pg[i]; } else printf("\n page %d is not allocated due to insufficient memory.",i+1); } printf("\n External Fragmentation is:%d",total); getch(); } OUTPUT Enter total memory size:1024 Enter memory for OS:256 Enter no. of pages:4 Enter size of page[1]:128 Enter size of page[2]:512 Enter size of page[3]:64 Enter size of page[4]:512 Allocate page 1 Al

implement Rail fence cipher in Java

// File Name: RailFence.java import java.util.*; class RailFenceBasic{ int depth; String Encryption(String plainText,int depth)throws Exception { int r=depth,len=plainText.length(); int c=len/depth; char mat[][]=new char[r][c]; int k=0; String cipherText=""; for(int i=0;i< c;i++) { for(int j=0;j< r;j++) { if(k!=len) mat[j][i]=plainText.charAt(k++); else mat[j][i]='X'; } } for(int i=0;i< r;i++) { for(int j=0;j< c;j++) { cipherText+=mat[i][j]; } } return cipherText; } String Decryption(String cipherText,int depth)throws Exception { int r=depth,len=cipherText.length(); int c=len/depth; char mat[][]=new char[r][c]; int k=0; String plainText=""; for(int i=0;i< r;i++) { for(int j=0;j< c;j++) { mat[i][j]=cipherText.charAt(k++); } } for(int i=0;i< c;i++) { for(int j=0;j< r;j++) { plainText+=mat[j][i]; } }

Deadlock Prevention using Banker’s Algorithm in C Programming

#include< stdio.h> #include< conio.h> void main() { int allocated[15][15],max[15][15],need[15][15],avail[15],tres[15],work[15],flag[15]; int pno,rno,i,j,prc,count,t,total; count=0; clrscr(); printf("\n Enter number of process:"); scanf("%d",&pno); printf("\n Enter number of resources:"); scanf("%d",&rno); for(i=1;i< =pno;i++) { flag[i]=0; } printf("\n Enter total numbers of each resources:"); for(i=1;i<= rno;i++) scanf("%d",&tres[i]); printf("\n Enter Max resources for each process:"); for(i=1;i<= pno;i++) { printf("\n for process %d:",i); for(j=1;j<= rno;j++) scanf("%d",&max[i][j]); } printf("\n Enter allocated resources for each process:"); for(i=1;i<= pno;i++) { printf("\n for process %d:",i); for(j=1;j<= rno;j++) scanf("%d",&allocated[i][j]); } printf("\n avai