Learning Java Program

class Outer 

{

     int outer_x = 100;
     void test() 

     {
          Inner inner = new Inner();
          inner.display();
     }
     

     // this is an inner class
     class Inner 

     {
          void display() 

          {
                System.out.println("Display: outer_x = " + outer_x);
          }
     }
}

class InnerClassDemo 

{
      public static void main(String args[])  

      {
           Outer outer = new Outer();
           outer.test();
      }
}

Display: outer_x = 100

class Stack

{
     private int stck[];
     private int tos;
     // allocate and initialize stack
     Stack(int size) 

     {
          stck = new int[size];
          tos = -1;
     }
     

     // Push an item onto the stack
     void push(int item) 

     {
          if(tos==stck.length-1) // use length member
          System.out.println("Stack is full.");
          else
          stck[++tos] = item;
     }

    
     // Pop an item from the stack
     int pop() 

     {
          if(tos < 0) 

          {
                System.out.println("Stack underflow.");
                return 0;
          }
          else
               return stck[tos--];
          }
     }

class TestStack 

{
       public static void main(String args[]) 

       {
            Stack mystack1 = new Stack(5);
            Stack mystack2 = new Stack(8);
            // push some numbers onto the stack
            for(int i=0; i<5; i++) mystack1.push(i);
            for(int i=0; i<8; i++) mystack2.push(i);
            // pop those numbers off the stack
            System.out.println("Stack in mystack1:");
            for(int i=0; i<5; i++)
            System.out.println(mystack1.pop());
            System.out.println("Stack in mystack2:");
            for(int i=0; i<8; i++)
            System.out.println(mystack2.pop());
       }
}

Stack in mystack1:
4
3
2
1
0
Stack in mystack2:
7
6
5
4
3
2
1
0

import java.util.Stack;
class TestStack 

{
      public static void main(String args[]) 

      {
            Stack mystack1 = new Stack();
            Stack mystack2 = new Stack();
                  // push some numbers onto the stack
            for(int i=0; i<10; i++)
                  mystack1.push(i);
            for(int i=10; i<20; i++)
                  mystack2.push(i);
                  // pop those numbers off the stack
            System.out.println("Stack in mystack1:");
                  for(int i=0; i<10; i++)
            System.out.println(mystack1.pop());
           

            System.out.println("Stack in mystack2:");
                  for(int i=0; i<10; i++)
            System.out.println(mystack2.pop());
      }
}

Stack in mystack1:
9
8
7
6
5
4
3
2
1
0
Stack in mystack2:
19
18
17
16
15
14
13
12
11
10

class Factorial 

{
     int fact(int n) 

     {
          int result;
          if(n==1) return 1;
          result = fact(n-1) * n;
          return result;
     }
}

class Recursion 

{
     public static void main(String args[]) 

     {
          Factorial f = new Factorial();
          System.out.println("Factorial of 4 is " + f.fact(4));
     }
}

Factorial of 4 is 24

class ContinueLabel 

{
     public static void main(String args[]) 

     {
         outer: for (int i=0; i<10; i++) 

         {
             for(int j=0; j<10; j++) 

             {
                  if(j > i) 

                  {
                       System.out.println();
                       continue outer;
                  }
                  System.out.print(" " + (i * j));
             }
         }
     System.out.println();
     }
}

class Continue 

{
     public static void main(String args[]) 

     {
          for(int i=0; i<10; i++) 

          {
                System.out.print(i + " ");
                if (i%2 == 0) continue;
                System.out.println("");
          }
     }
}

class Nested 

{
     public static void main(String args[]) 

     {
        int i, j;
        for(i=0; i<10; i++) 

        {
             for(j=i; j<10; j++)
             System.out.print(".");
             System.out.println();
        }
     }
}