Q:

Ruby program to find the prime numbers from the array

0

In this program, we will create an array of integer elements. Then we will find the prime numbers from the array.

All Answers

need an explanation for this answer? contact us directly to get an explanation for this answer

Program/Source Code:

The source code to find the prime numbers from the array is given below. The given program is compiled and executed successfully.

# Ruby program to find the prime numbers 
# from the array

arr = [12,45,23,39,37];

i = 0;
j = 0;
flag = 0;
        
print "Prime Numbers are:\n";
while(i<arr.size)
    flag = 0;
    j=2;
    
    while(j<arr[i]/2)
        if(arr[i]%j==0)
            flag=1;
        end
        j=j+1
    end
    
    if(flag == 0)
        print arr[i]," ";
    end
    i=i+1		
end

Output:

Prime Numbers are:
23 37

Explanation:

In the above program, we created an array of integer elements. Then we found the array prime numbers from the array and printed the result.

need an explanation for this answer? contact us directly to get an explanation for this answer

total answers (1)

This question belongs to these collections

Similar questions


need a help?


find thousands of online teachers now