sql query permutations without repetition

Question

question

Qrosh asked Dec 2, '12

sql query permutations without repetition

I need a query which can be used in (or as) a function and retrieves all permutations of n values. And I need all permutations of length k where k = 1..n. Extended sample input and result so input has 3 values instead of 2 - however, number of input values may vary from 1 to n. Example: Input: table with values in one column in multiple rows Value (nvarchar(500)) ------ Ann John Mark Output#1: table with values concatenated in one column Ann John Mark Ann,John Ann,Mark John,Mark Ann,John,Mark

sql-server-2012 transaction permutations

10 |1200

Attachments: Up to 2 attachments (including images) can be used with a maximum of 512.0 KiB each and 1.0 MiB total.

Answer 1 · 2012-12-02T10:25:22Z

ThomasRushton answered Dec 2, '12

You might want to start by having a look at am old speed phreak contest that does permutations... http://ask.sqlservercentral.com/questions/3045/the-word-permutation-sql-problem.html

10 |1200

Attachments: Up to 2 attachments (including images) can be used with a maximum of 512.0 KiB each and 1.0 MiB total.

Answer 2 · 2012-12-03T12:37:27Z

Kevin Feasel answered Dec 3, '12

[Paul White's answers to this exact question][1]. I doubt I could add anything to his explanation. [1]: http://dba.stackexchange.com/a/29666/14907

10 |1200

Attachments: Up to 2 attachments (including images) can be used with a maximum of 512.0 KiB each and 1.0 MiB total.

question