Created
February 16, 2016 14:41
-
-
Save Praveenrajmani/be65b409d707461f2002 to your computer and use it in GitHub Desktop.
Go Program to find the largest prime in 60 secs
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
package main | |
import "fmt" | |
import "time" | |
func main() { | |
t0 := time.Now() | |
lprime := 0 | |
resulting := 0 | |
for i:=2 ;resulting<60 ;i++ { | |
if Is_prime(i) == 1 { | |
fmt.Println("\n",i) | |
lprime = i | |
t1 := time.Now() | |
resulting = int(t1.Sub(t0)/(time.Millisecond*1000)) | |
} else { | |
t1 := time.Now() | |
resulting = int(t1.Sub(t0)/(time.Millisecond*1000)) | |
} | |
} | |
fmt.Println("\n\n The largest prime is ",lprime) | |
} | |
func Is_prime(number int) int { | |
var count int = 0 | |
for i:=1; i<=number; i++ { | |
if number%i == 0 { | |
count++ | |
} | |
} | |
if count == 2 { | |
return 1 | |
} else { | |
return 0 | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment