[Java] [Function] Decompose prime factors

Decompose a positive integer into prime factors. For example: input 90 and print out 90=2 3 3*5.

package com.itheima;
import java.util.*;
public class Main {
    
    
    public static void main(String[] args) {
    
    
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        decompose(n);

    }
    static void decompose(int n){
    
    
        System.out.print(n + " = ");
        int m = (int)Math.sqrt(n);
        for(int i=2;i<=m;i++){
    
    
            if(n % i == 0 && n > i){
    
    
                System.out.print(i + "*");
                n /= i;
                i--;
            }
        }
        System.out.print(n);
    }

}