//Find power of Number using recursive method.
public class Calculator {
    public static void main(String[] args) {
      int base=2;
      int power=3;
      System.out.println(base+"^"+power+" = "+ pow(base,power));
    }
public static int pow(int base,int power){
        if (power==0)
            return 1;
        return (base*pow(base,power-1));
    }
}
 //Telegram channal: @java_tutorial0101

public class Main {
    public static void main(String[] args) {
    //increment operations
    int n=1;
    System.out.println(n++);//output: 1
    System.out.println(n);//output: 2
    n++;
    System.out.println(n);//output: 3
    
    int m=1;
    System.out.println(++m);//output: 2
    System.out.println(m);//output: 2
    ++m;
    System.out.println(m);//ouput: 3

    //decrement operations
    int n2=4;
    System.out.println(n2--);//output: 4
    System.out.println(n2);//output: 3
    n2--;
    System.out.println(n2);//outpu: 2

    int m2=4;
    System.out.println(--m2);//output: 3
    System.out.println(m2);//output: 3
    --m2;
    System.out.println(m2);//output: 2

    }
    //Telegram channal: @java_tutorial0101