Perfect Shuffling

Computer Science Level 1

A "perfect shuffle" is a shuffle where the elements of an ordered set are split in "half," then combined starting with the first element of the first half, then the first element of the second half, and so on.

In the case of an odd number of set elements, the first "half" gets the extra element.

Given an ordered set of $n$ elements, how many consecutive perfect shuffles are needed to return the set to its original order?

A) $\ n - 2$
B) $\ n$
C) $\ n + 2$
D) $\ 2^n$
E) $\ \log_2 n$

A) always B) always C) always D) always A) if

n

is odd; B) if

n

is even; C) if

n

is a power of 2 A) if

n

is odd; C) if

n

is even; D) if

n

is a power of 2 A) if

n

is odd; C) if

n

is even; E) if

n

is a power of 2 B) if

n

is odd; C) if

n

is even; E) if

n

is a power of 2

1 solution

Tj Evert
Apr 11, 2018

See Faro Shuffle

Perfect Shuffling

1 solution

0 pending reports