Skip to content

Instantly share code, notes, and snippets.

@tsaniel

tsaniel/LICENSE.txt

Forked from 140bytes/LICENSE.txt
Created July 22, 2011 05:58
Show Gist options
  • Save tsaniel/1098962 to your computer and use it in GitHub Desktop.
Save tsaniel/1098962 to your computer and use it in GitHub Desktop.
Download ZIP
isPrimeNumber (using RegExp)
Raw
README.md
Raw
annotated.js
function(
a // the number
){
return !/^,?$|^(,,+)\1+$/.test(
Array( // repeat the string ','
-~a // coerce to integer
)
)
}
Raw
index.js
function(a){return!/^,?$|^(,,+)\1+$/.test(Array(-~a))}
Raw
LICENSE.txt
DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
Version 2, December 2004
Copyright (C) 2011 YOUR_NAME_HERE <YOUR_URL_HERE>
Everyone is permitted to copy and distribute verbatim or modified
copies of this license document, and changing it is allowed as long
as the name is changed.
DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
0. You just DO WHAT THE FUCK YOU WANT TO.
Raw
package.json
{
"name": "isPrimeNumber",
"description": "Check if a number is prime with RegExp",
"keywords": [
"isPrimeNumber",
"RegExp",
"Prime"
]
}
Raw
test.html
<!DOCTYPE html>
<title>isPrimeNumber</title>
<div>Expected value: <b>true</b></div>
<div>Actual value: <b id="ret"></b></div>
<script>
var myFunction = function(a){return!/^,?$|^(,,+)\1+$/.test(Array(-~a))};
document.getElementById( "ret" ).innerHTML = myFunction(541)
</script>
@Kambfhase
Copy link

All solutions have an exponential complexity of O(d^n)

I'd like to see a prove for that.

OK, guys. stop wasting your time now and get sane. An End to Negativity!

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment