sequence update

Author: jiisanda

Diff for: Mathematics/2.1.1.count_digits_iterative.py

@@ -0,0 +1,33 @@
+"""
+COUNT DIGITS METHOD - I: Iterative Method
+
+Given a number count the number of digits
+
+IP: 65415
+OP: 5
+
+IP: 787878
+OP: 6
+
+TC: O(log10(n))
+SC: O(1)
+"""
+
+def count_digit(num: int)-> int:
+    """ Iterative Method
+
+    Args:
+        num (int): number to count digits of
+
+    Returns:
+        int: Number of digits in a number
+    """
+    count = 0
+    while num != 0:
+        num //= 10
+        count += 1
+    return count
+
+if __name__ == '__main__':
+    N = int(input('Enter the number: '))
+    print("The number of digits in ", N, "is", count_digit(N))

Diff for: Mathematics/2.1.2.count_digits_recursive.py

@@ -0,0 +1,32 @@
+"""
+COUNT DIGITS METHOD - II: Recursive Method
+
+Given a number count the number of digits
+
+IP: 65415
+OP: 5
+
+IP: 787878
+OP: 6
+
+TC: O(log n)
+SC: O(log n)
+"""
+
+def count_digit(num: int)-> int:
+    """ Recursive Method
+
+    Args:
+        num (int): number to count digits of
+
+    Returns:
+        int: Number of digits in a number
+    """
+    if num == 0:
+        return 0
+    return 1 + count_digit(num//10)
+
+
+if __name__ == '__main__':
+    N = int(input('Enter the number: '))
+    print("The number of digits in ", N, "is", count_digit(N))

Diff for: Mathematics/2.1.3.count_digit_conversion.py

@@ -0,0 +1,21 @@
+"""
+COUNT DIGITS METHOD - I: Iterative Method
+
+Given a number count the number of digits
+
+IP: 65415
+OP: 5
+
+IP: 787878
+OP: 6
+
+
+"""
+
+def count_digit(n):
+    """ Conversion """
+    # n = len(str(n))
+    # return n
+
+n = 23965465
+print("The number of digits in ", n, "is", count_digit(n))

Diff for: Mathematics/palindrome_number.py renamed to Mathematics/2.2.1.palindrome_number.py

@@ -0,0 +1,41 @@
+"""
+CHECK FOR PRIME
+
+Check whether the given number is Prime or not.
+
+IP: N = 5
+OP: The number 5 is Prime.
+
+IP: N = 10
+OP: The number 10 is not Prime.
+
+TC: O(sqrt(n))
+SC: O(1)
+"""
+
+from math import sqrt
+
+def check_prime(num: int) -> bool:
+    """Check if the number is prime
+
+    Args:
+        num (int): number to check
+
+    Returns:
+        bool: True if number is Prime, False otherwise
+    """
+    # Base Case
+    if num <= 1:
+        return False
+    # Verifying from 2 to sqrt(num)
+    for i in range(2, int(sqrt(num)) + 1):
+        if num % i == 0:
+            return False
+    return True
+
+if __name__ == '__main__':
+    n = int(input("Enter a number to check prime..."))
+    if check_prime(n):
+        print(f'The number {n} is Prime.')
+    else:
+        print(f'The number {n} is not Prime.')