We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Java
  3. Object Oriented Programming
  4. Java Interface
  5. Discussions

Java Interface

  • julian_n_robbins
     + 0 comments

    You can optimize by going only up to sqrt(n) and adding both the factors at once (similar principal when looking for Prime numbers).

        public int divisor_sum(int n) {
        if(n==1) return 1;
        int sum=0;
        for(int i=1; i * i <= n; i++) {
            if(n%i==0) {
                sum += i;
                sum += n/i; //other factor of a * b = n
            }
        }
        return sum;
    }