Pairs in array

-

 class pairs{


    public static void main(String[] args) {
       
        int arr[]={3,4,2,5,7};

        for(int i=0;i<arr.length;i++){
            for(int j=i+1;j<arr.length;j++){

                System.out.print("("+arr[i]+","+arr[j]+")");

            }
            System.out.println();
        }
    }
}

Output:-

Comments

Post a Comment

Popular posts from this blog

Switch case advance usage

-
  import java . util .* ; public class weekday {     public static void main ( String [] args ) {         Scanner sc = new Scanner ( System . in );         System . out . println ( "Enter the number" );         int n = sc . nextInt ();         switch ( n ) {             case 1 , 2 , 3 , 4 , 5 : { System . out . println ( "week day" ); break ;}             case 6 , 7 : { System . out . println ( "week end" ); break ;}             default: System . out . println ( "Invalid Day" );                   }     }     }
Read more

Inheritance

-
  public class inheritance {     public static void main( String [] args) {         Fish f= new Fish();         f.eats();             }     } class Animals{     void eats(){         System.out.println( "Animal is eating" );     } } class Fish extends Animals{     int fins; }
Read more

Sub-array with worst case time complexity

-
Image
  import java . util .* ; class subarray {     public static void printsubarray ( int arr []){         int len = arr . length ;         int z = 0 , max = 0 , min = 100 ;         int totalsubstring = ( len ) * ( len + 1 ) / 2 ;         int sum [] = new int [ totalsubstring ];         for ( int i = 0 ; i <= arr . length ; i ++){             for ( int j = i + 1 ; j <= arr . length ; j ++){                 for ( int k = i ; k < j ; k ++){                     System . out . print ( arr [ k ] + " " );                     sum [ z ] = sum [ z ] + arr [ k ];                     max = Math . max ( sum [ z ], max );         ...
Read more