Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with code-golf
Search options not deleted
user 30315
Code-golf is a competition to solve a particular problem in the fewest bytes of source code.
3
votes
Generate a Universal-binary-function Lookup Table
Javascript (ECMA6), 67
s=(k,n)=>n-.5?s((k<<n/2)^k,n/2)+"0".repeat(n)+k.toString(2)+"\n":""
To use this, call
s(255,8)
Bitshift!
And also XOR and a bit of recursion.
The first thing to notice …
- 49
0
votes
Determine whether strings are anagrams
Javascript - 57 chars
function o(a,b){return b?o(a)==o(b):1+a.split("").sort()}
- 49