Bash program to check if the Number is a Prime or not
Given a number, the task is to find whether the given number is prime or not using Bash Scripting. Examples:
Input: N = 43 Output: Prime Input: N = 35 Output: Not Prime
Prime Numbers: A prime number is a whole number greater than 1, which is only divisible by 1 and itself. First few prime numbers are : 2 3 5 7 11 13 17 19 23 …..
Approach: We run a loop from 2 to number/2 and check if there is any factor of the number. If we find any factor then the number is composite otherwise prime. Implementation:
Time complexity: O(N) for input N because using a while loop
Auxiliary Space: O(1)
My Personal Notes arrow_drop_up
Please Login to comment...