forked from smpetersgithub/AdvancedSQLPuzzles
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathPermutations Recursion.sql
More file actions
57 lines (51 loc) · 1.25 KB
/
Copy pathPermutations Recursion.sql
File metadata and controls
57 lines (51 loc) · 1.25 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
/*----------------------------------------------------
Scott Peters
Permutations
https://advancedsqlpuzzles.com
Last Updated: 01/13/2023
Microsoft SQL Server T-SQL
Displays all permutations for the numbers 1 through n.
*/----------------------------------------------------
---------------------
---------------------
DROP TABLE IF EXISTS #Numbers;
GO
---------------------
---------------------
DECLARE @vTotalNumbers INTEGER = 3;
---------------------
---------------------
WITH cte_Numbers (Number)
AS (
SELECT 1 AS Number
UNION ALL
SELECT Number + 1
FROM cte_Numbers
WHERE Number < @vTotalNumbers
)
SELECT
Number
INTO #Numbers
FROM cte_Numbers
OPTION (MAXRECURSION 0);
---------------------
---------------------
WITH cte_Recursion (Permutation, Id, Depth)
AS
(
SELECT CAST(Number AS VARCHAR(MAX)),
CAST(CONCAT(Number,';') AS VARCHAR(MAX)),
1 AS Depth
FROM #Numbers
UNION ALL
SELECT CONCAT(a.Permutation,',',b.Number),
CONCAT(a.Id,b.Number,';'),
a.Depth + 1
FROM cte_Recursion a,
#Numbers b
WHERE a.Depth < @vTotalNumbers AND
a.Id NOT LIKE CONCAT('%',b.Number,';%')
)
SELECT Permutation
FROM cte_Recursion;
GO