ADVERTISEMENT
ADVERTISEMENT

Ruby program to find the prime numbers from the array

Ruby Example: Write a program to find the prime numbers from the array.
Submitted by Nidhi, on January 19, 2022

Problem Solution:

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

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.

Ruby Arrays Programs »


ADVERTISEMENT
ADVERTISEMENT


Comments and Discussions!



ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT

Languages: » C » C++ » C++ STL » Java » Data Structure » C#.Net » Android » Kotlin » SQL
Web Technologies: » PHP » Python » JavaScript » CSS » Ajax » Node.js » Web programming/HTML
Solved programs: » C » C++ » DS » Java » C#
Aptitude que. & ans.: » C » C++ » Java » DBMS
Interview que. & ans.: » C » Embedded C » Java » SEO » HR
CS Subjects: » CS Basics » O.S. » Networks » DBMS » Embedded Systems » Cloud Computing
» Machine learning » CS Organizations » Linux » DOS
More: » Articles » Puzzles » News/Updates

© https://www.includehelp.com some rights reserved.