Timeline for t-sql - combinatorics
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 26, 2012 at 21:09 | comment | added | db2 | Yeah, it's just a simple decimal-to-binary converter, and a query that feeds the standard master..spt_values numbers table through it, then converts 1 and 0 to X and -. Of course, it only works for simple yes/no type questions. You'd have to make an arbitrary base converter to handle more than that. | |
| Jan 26, 2012 at 18:15 | vote | accept | sarov | ||
| Jan 26, 2012 at 17:55 | comment | added | sarov | It took me a second to wrap my head around this solution. I really like it. Clean and efficient. I ran it against a 14 character response string (16,384 combinations) and it ripped right through them before the key was up. | |
| Jan 25, 2012 at 14:54 | history | answered | db2 | CC BY-SA 3.0 |