Commit ee95621

committed

added snippet for checking if number is a prime

1 parent ce14126 commit ee95621Copy full SHA for ee95621

File tree

+31

-0

lines changed

+31

-0

lines changed

Lines changed: 31 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,31 @@`
	`1`	`+---`
	`2`	`+title: Prime Check`
	`3`	`+description: Checks if a number is a prime`
	`4`	`+author: Mcbencrafter`
	`5`	`+tags: math,number,prime`
	`6`	`+---`
	`7`	`+`
	`8`	+```java
	`9`	`+public static boolean isPrime(int number) {`
	`10`	`+ if (number <= 1)`
	`11`	`+ return false;`
	`12`	`+`
	`13`	`+ if (number <= 3)`
	`14`	`+ return true;`
	`15`	`+`
	`16`	`+ boolean prime = true;`
	`17`	`+ for (int divisor = 3; divisor < number; divisor++) {`
	`18`	`+ if (number % divisor != 0)`
	`19`	`+ continue;`
	`20`	`+`
	`21`	`+ prime = false;`
	`22`	`+ break;`
	`23`	`+ }`
	`24`	`+`
	`25`	`+ return prime;`
	`26`	`+}`
	`27`	`+`
	`28`	`+// Usage:`
	`29`	`+int number = 31;`
	`30`	`+System.out.println(isPrime(number)); // true`
	`31`	+```

Comments

(0)