Data commit

Task/Perfect-shuffle/MATLAB/perfect-shuffle-1.m

@@ -0,0 +1,9 @@
+function [New]=PerfectShuffle(Nitems, Nturns)
+    if mod(Nitems,2)==0 %only if even number
+        X=1:Nitems; %define deck
+        for c=1:Nturns %defines one shuffle
+            X=reshape(X,Nitems/2,2)'; %split the deck in two and stack halves
+            X=X(:)'; %mix the halves
+        end
+        New=X; %result of multiple shufflings
+    end

Task/Perfect-shuffle/MATLAB/perfect-shuffle-2.m

@@ -0,0 +1,13 @@
+Result=[]; %vector to store results
+Q=[8, 24, 52, 100, 1020, 1024, 10000]; %queries
+for n=Q %for each query
+    Same=0; %initialize comparison
+    T=0; %initialize number of shuffles
+    while ~Same %while the result is not the original query
+        T=T+1; %one more shuffle
+        R=PerfectShuffle(n,T); %result of shuffling the query
+        Same=~(any(R-(1:n))); %same vector as the query
+    end %when getting the same vector
+    Result=[Result;T]; %collect results
+end
+disp([Q', Result])