Search⌘ K
AI Features
Home
Courses
Algorithms for Coding Interviews in C#

Challenge: Shuffle Integers

Explore how to shuffle an array of integers whose size is a power of two without extra space. Understand the problem setup, design a step-by-step algorithm, and apply divide and conquer principles to solve this shuffle challenge efficiently.

We'll cover the following...

Shuffle integers

Suppose you have an array of size 2n2^n (the size of the array is a multiple of 2) arranged as:

Initial arrangement of elements in the array
Initial arrangement of elements in the array

In the context of this problem, we will call this array shuffled if its elements were to get rearranged like this:

Shuffled arrangement of the aray
Shuffled arrangement of the aray

Problem statement:

Given an array of integers of size 2n2^n and taking all the boundary cases into consideration, shuffle the array without using extra space.

Input

  • arr: An array of integers.

Output

  • arr: A shuffled array if the size of the array is in 2n2^n; otherwise, the same array.

Sample input

arr = {1, 2, 3, 4, 5, 6, 7, 8};

Sample output

arr = {1, 5, 2, 6, 3, 7, 4, 8};

Coding challenge

First, take a close look at this problem and design a step-by-step algorithm before jumping to the implementation. This problem is designed for your practice, so try to solve it on your own first. If you get stuck, you can always refer to the solution provided in the solution section. Good luck!

C# 9.0
using System;
public class Program
{
    /// <summary>
    /// Shuffles the array.
    /// </summary>
    /// <param name="arr">Array of integers.</param>
    public static void ShuffleArray(int[] arr)
    {
        // Write your code here!
    }
}