Sunday, September 4, 2016
JAVA PROGRAM TO FIND BIGGEST NUMBER BETWEEN N NUMBER
import
java.util.Scanner;
class group{
public static void main(String argn[]){
Scanner data = new Scanner(System.in);
int num, i, temp, max;
// Reading numbers want to be read
System.out.print("Enter number you want to enter:");
num = data.nextInt();
System.out.println("Enter " +num+ " number");
// Reading 1st number
max = data.nextInt();
// Reading other number
for (i=1; i < num; i++) { temp = data.nextInt();
if(temp < max)
continue;
else
// largest number
max = temp;
}
System.out.println("Largest Number is "+max);
}
}
Output:-
Enter number you want to enter:
10
Enter 10 number
248
445852
248
215
25854
2145
11458
21145
115
115585
Largest Number is 445852
class group{
public static void main(String argn[]){
Scanner data = new Scanner(System.in);
int num, i, temp, max;
// Reading numbers want to be read
System.out.print("Enter number you want to enter:");
num = data.nextInt();
System.out.println("Enter " +num+ " number");
// Reading 1st number
max = data.nextInt();
// Reading other number
for (i=1; i < num; i++) { temp = data.nextInt();
if(temp < max)
continue;
else
// largest number
max = temp;
}
System.out.println("Largest Number is "+max);
}
}
Output:-
Enter number you want to enter:
10
Enter 10 number
248
445852
248
215
25854
2145
11458
21145
115
115585
Largest Number is 445852
Java Program To Find Largest and Smallest Number in an Array
- public class FindLargestSmallestNumber {
- public static void main(String[] args) {
- //array of 10 numbers
- int numbers[] = new int[]{32,43,53,54,32,65,63,98,43,23};
- //assign first element of an array to largest and smallest
- int smallest = numbers[0];
- int largetst = numbers[0];
- for(int i=1; i< numbers.length; i++)
- {
- if(numbers[i] > largetst)
- largetst = numbers[i];
- else if (numbers[i] < smallest)
- smallest = numbers[i];
- }
- System.out.println("Largest Number is : " + largetst);
- System.out.println("Smallest Number is : " + smallest);
- }
- }
- /*
- Output of this program would be
- Largest Number is : 98
- Smallest Number is : 23
- */
Java Program To Find Largest and Smallest Number
public static void main(String[] args) {
int smallest = 0;
int large = 0;
int num;
System.out.println("enter the number");//how many number you want to enter
Scanner input = new Scanner(System.in);
int n = input.nextInt();
num = input.nextInt();
smallest = num; //assume first entered number as small one
// i starts from 2 because we already took one num value
for (int i = 2; i < n; i++) {
num = input.nextInt();
//comparing each time entered number with large one
if (num > large) {
large = num;
}
//comparing each time entered number with smallest one
if (num < smallest) {
smallest = num;
}
}
System.out.println("the largest is:" + large);
System.out.println("Smallest no is : " + smallest);
}
Java program to find largest of three numbers
import java.util.Scanner; class LargestOfThreeNumbers { public static void main(String args[]) { int x, y, z; System.out.println("Enter three integers "); Scanner in = new Scanner(System.in); x = in.nextInt(); y = in.nextInt(); z = in.nextInt(); if ( x > y && x > z ) System.out.println("First number is largest."); else if ( y > x && y > z ) System.out.println("Second number is largest."); else if ( z > x && z > y ) System.out.println("Third number is largest."); else System.out.println("Entered numbers are not distinct."); } }
Java Program To Check whether string is palindrome or not
import
java.util.Scanner;
public
class Palindrome {
public
static void main(String[] args)
{
System.out.println("Please
Enter a number : ");
int givennumber = new Scanner(System.in).nextInt();
int number=givennumber;
int reverse=0;
while (number != 0) {
int remainder = number % 10;
reverse = reverse * 10 + remainder;
number = number / 10;
}
if(givennumber
== reverse)
System.out.println("Result:Palindrome");
else
System.out.println("Result:Not Palindrome");
}
}
Java Program for Fibonacci series using recursion in java
public class FibanacciRecursive {
public void fibanci(int n1,int n2){
int sum=0;
if(n1==0){
System.out.println(n1+"\n"+n2);
}
sum=n1+n2;
if(sum<=100){
System.out.println(sum);
n1=n2;
n2=sum;
fibanci(n1,n2);
}
}
public static void main(String[] args) {
FibanacciRecursive fb=new FibanacciRecursive();
fb.fibanci(0,1);
}
}
Output:
0
1
1
2
3
5
8
13
21
34
55
89
Subscribe to:
Posts (Atom)