Java Program to find the largest digit of a number using recursion


In this program, you will learn how to find the largest digit of a number using recursion in java.


123 => 3

2341 => 4

Example: How to find the largest digit of a number using recursion in java.

import java.util.Scanner;

class Main {
    int lar = 0, r;


    int largestDigit(int n) {

        if (n > 0) {
            r = n % 10;
            if (lar < r)
                lar = r;
            largestDigit(n / 10);
        }

        return lar;
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        System.out.print("Enter a number:");
        int n = sc.nextInt();

        Main obj = new Main();
        int lar = obj.largestDigit(n);

        System.out.println("Largest digit:" + lar);


    }
}

Output:

Enter a number:3452
Largest digit:5

Xiith is created for educational, experimental, and schooling purpose. Examples on Xiith are made easier to make a better or basic understanding. Tutorials, testimonials, and examples are continuously checked to avoid delusion, but we cannot take complete responsibility of all programs on Xiith. When you are operating this site, you have to agree to read and accept our terms of use, cookie and privacy policy.Copyright © 2020 by Xiith. All Rights Reserved. About us.