Simple algorithm that checks if a number is prime or composite, built using basic principles of Java OOP.
-
Notifications
You must be signed in to change notification settings - Fork 0
AruneemB/CheckForPrime
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Simple algorithm that checks if a number is prime or composite, built using basic principles of Java OOP.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published