Mobbiinfo

Write program for to print prie numbers: Definition : A prime number is a whole number greater than 1, whose only two whole-number factors are 1 and itself.  The first few prime numbers are 2, 3, 5, 7, 11, 13, 17, 19, 23, and 29.   package mobbiinfo.PrimeNumers; import java.util.Scanner; public class PrimeNumbers {        public static void main(String[] args ){        Scanner sc = new Scanner(System. in );        System. out .println( "enter range of prime Numbers" );        int n =Integer. parseInt ( sc .next());        int n1 =Integer. parseInt ( sc .next());               for ( int i = n ; i < n1 ; i ++){                      boolean isPrime =...

Java Program for Sorting Of Array minimum to maximum WITHOUT USING SORTING method package mobbiinfo; public class SortingOfArrayMaximumToMinimum {        public static void main(String[] args ) {               int s ;               int i []={5,7,1,6,2,4};               int j = i . length ;                             for ( int c =0; c < j ; c ++){                      for ( c =0; c < j -1; c ++){                      ...

Java Program for Sorting Of Array minimum to maximum WITHOUT USING SORTING method package mobbiinfo.SortingOfArray; public class SortingOfArray {        public static void main(String[] args ) {               int s ;               int i []={5,7,1,6,2,4};               int j = i . length ;                             for ( int c =0; c < j ; c ++){                      for ( c =0; c < j -1; c ++){                     ...

Write a program to Print Right Angle Triangle package mobbiinfo.RightAngleTriangle; public class RightAngleTriangle {        public static void main(String[] args ) {                                    for ( int i =1; i <=5; i ++){                      for ( int j =1; j <=5; j ++){                            if (( i + j )>5){                                   System. out .print( "*" );  ...

Write a program to Print Equilateral Triangle pattern                                                                                                                                      *                                                                                                                           * *           ...