Added fastest way to compute number of divisors of a number

rajnis09 · rajnis09 · commit dfd0423d0e6a · 2019-10-13T14:34:45.000+05:30
diff --git a/Algorithms/ComputeNumberOfDivisors.java b/Algorithms/ComputeNumberOfDivisors.java
@@ -0,0 +1,23 @@
+class ComputeNumberOfDivisors {
+
+    // Function that calculates number of divisors
+    // Time Complexity : O( (n)^ 1/2 )
+    static int numberOfDivisors(int n) {
+        int count = 0;
+        for (int i = 1; i <= Math.sqrt(n); i++) {
+            if (n % i == 0) {
+                if (n / i == i) {
+                    count++;
+                } else {
+                    count += 2;
+                }
+            }
+        }
+        return count;
+    }
+
+    public static void main(String[] args) {
+        int x = 25;
+        System.out.println("Total number of divisor of " + x + " are " + numberOfDivisors(x));
+    }
+}
