Print all intervals of given number

Here given code implementation process.

// C Program 
// Print all intervals of given number
#include <stdio.h>

//  Display calculated intervals
void display(int auxiliary[], int size)
{
	for (int i = 0; i < size; ++i)
	{
		printf(" %d", auxiliary[i]);
	}
	printf("\n");
}
// Find the elements from 1 to n in specific intervals
void findIntervals(int auxiliary[], int element, int size, int n)
{
	if (element > n)
	{
		// Display calculated result
		display(auxiliary, size);
		return;
	}
	for (int i = 0; i < size; ++i)
	{
		if (auxiliary[i] == 0 && i + element + 1 < size && auxiliary[i + element + 1] == 0)
		{
			// Insert element on particular distance
			auxiliary[i] = element;
			auxiliary[i + element + 1] = element;
			findIntervals(auxiliary, element + 1, size, n);
			// Reset value
			auxiliary[i] = 0;
			auxiliary[i + element + 1] = 0;
		}
	}
}
// Handles the request of printing number intervals
void printIntervals(int intervals)
{
	if (intervals <= 1)
	{
		return;
	}
	printf("Intervals size %d \n", intervals);
	// Used to store results
	int auxiliary[intervals *2];
	for (int i = 0; i < intervals *2; ++i)
	{
		auxiliary[i] = 0;
	}
	//  print all intervals
	findIntervals(auxiliary, 1, intervals *2, intervals);
	printf("\n");
}
int main(int argc, char
	const *argv[])
{
	// Test case
	printIntervals(4);
	printIntervals(7);
	return 0;
}

Output

Intervals size 4
 4 1 3 1 2 4 3 2
 2 3 4 2 1 3 1 4

Intervals size 7
 1 7 1 2 5 6 2 3 4 7 5 3 6 4
 1 7 1 2 6 4 2 5 3 7 4 6 3 5
 1 6 1 7 2 4 5 2 6 3 4 7 5 3
 1 5 1 6 7 2 4 5 2 3 6 4 7 3
 1 4 1 5 6 7 4 2 3 5 2 6 3 7
 1 4 1 6 7 3 4 5 2 3 6 2 7 5
 1 6 1 3 5 7 4 3 6 2 5 4 2 7
 1 5 1 7 3 4 6 5 3 2 4 7 2 6
 1 5 1 6 3 7 4 5 3 2 6 4 2 7
 1 5 1 4 6 7 3 5 4 2 3 6 2 7
 5 1 7 1 6 2 5 4 2 3 7 6 4 3
 4 1 7 1 6 4 2 5 3 2 7 6 3 5
 4 1 6 1 7 4 3 5 2 6 3 2 7 5
 7 1 3 1 6 4 3 5 7 2 4 6 2 5
 7 1 4 1 6 3 5 4 7 3 2 6 5 2
 6 1 5 1 7 3 4 6 5 3 2 4 7 2
 4 6 1 7 1 4 5 2 6 3 2 7 5 3
 7 3 1 6 1 3 4 5 7 2 6 4 2 5
 4 6 1 7 1 4 3 5 6 2 3 7 2 5
 5 6 1 7 1 3 5 4 6 3 2 7 4 2
 7 4 1 5 1 6 4 3 7 5 2 3 6 2
 5 7 1 4 1 6 5 3 4 7 2 3 6 2
 3 6 7 1 3 1 4 5 6 2 7 4 2 5
 5 7 4 1 6 1 5 4 3 7 2 6 3 2
 2 6 7 2 1 5 1 4 6 3 7 5 4 3
 4 5 6 7 1 4 1 5 3 6 2 7 3 2
 2 3 7 2 6 3 5 1 4 1 7 6 5 4
 3 4 5 7 3 6 4 1 5 1 2 7 6 2
 2 3 6 2 7 3 4 5 1 6 1 4 7 5
 5 2 4 7 2 6 5 4 1 3 1 7 6 3
 2 6 3 2 7 4 3 5 6 1 4 1 7 5
 2 6 3 2 5 7 3 4 6 1 5 1 4 7
 2 4 7 2 3 6 4 5 3 1 7 1 6 5
 5 2 7 3 2 6 5 3 4 1 7 1 6 4
 5 2 4 6 2 7 5 4 3 1 6 1 3 7
 3 5 7 2 3 6 2 5 4 1 7 1 6 4
 2 7 4 2 3 5 6 4 3 7 1 5 1 6
 2 5 6 2 3 7 4 5 3 6 1 4 1 7
 5 2 6 4 2 7 5 3 4 6 1 3 1 7
 5 7 2 3 6 2 5 3 4 7 1 6 1 4
 5 3 6 7 2 3 5 2 4 6 1 7 1 4
 3 4 6 7 3 2 4 5 2 6 1 7 1 5
 7 2 6 3 2 4 5 3 7 6 4 1 5 1
 7 2 4 6 2 3 5 4 7 3 6 1 5 1
 6 2 7 4 2 3 5 6 4 3 7 1 5 1
 7 2 4 5 2 6 3 4 7 5 3 1 6 1
 5 7 2 6 3 2 5 4 3 7 6 1 4 1
 7 3 6 2 5 3 2 4 7 6 5 1 4 1
 3 7 4 6 3 2 5 4 2 7 6 1 5 1
 3 5 7 4 3 6 2 5 4 2 7 1 6 1
 5 3 6 4 7 3 5 2 4 6 2 1 7 1
 4 6 3 5 7 4 3 2 6 5 2 1 7 1

/*
   Java Program
   Print all intervals of given number
*/
class Interval
{
	//  Display calculated intervals
	public void display(int[] auxiliary, int size)
	{
		for (int i = 0; i < size; ++i)
		{
			System.out.print(" " + auxiliary[i]);
		}
		System.out.print("\n");
	}
	// Find the elements from 1 to n in specific intervals
	public void findIntervals(int[] auxiliary, int element, int size, int n)
	{
		if (element > n)
		{
			// Display calculated result
			display(auxiliary, size);
			return;
		}
		for (int i = 0; i < size; ++i)
		{
			if (auxiliary[i] == 0 && i + element + 1 < size && auxiliary[i + element + 1] == 0)
			{
				// Insert element on particular distance
				auxiliary[i] = element;
				auxiliary[i + element + 1] = element;
				findIntervals(auxiliary, element + 1, size, n);
				// Reset value
				auxiliary[i] = 0;
				auxiliary[i + element + 1] = 0;
			}
		}
	}
	// Handles the request of printing number intervals
	public void printIntervals(int intervals)
	{
		if (intervals <= 1)
		{
			return;
		}
		System.out.print(" Intervals size " + intervals + " \n");
		// Used to store results
		int[] auxiliary = new int[intervals * 2];
		for (int i = 0; i < intervals * 2; ++i)
		{
			auxiliary[i] = 0;
		}
		//  print all intervals
		findIntervals(auxiliary, 1, intervals * 2, intervals);
		System.out.print("\n");
	}
	public static void main(String[] args)
	{
		Interval task = new Interval();
		// Test case
		task.printIntervals(4);
		task.printIntervals(7);
	}
}

Output

 Intervals size 4
 4 1 3 1 2 4 3 2
 2 3 4 2 1 3 1 4

 Intervals size 7
 1 7 1 2 5 6 2 3 4 7 5 3 6 4
 1 7 1 2 6 4 2 5 3 7 4 6 3 5
 1 6 1 7 2 4 5 2 6 3 4 7 5 3
 1 5 1 6 7 2 4 5 2 3 6 4 7 3
 1 4 1 5 6 7 4 2 3 5 2 6 3 7
 1 4 1 6 7 3 4 5 2 3 6 2 7 5
 1 6 1 3 5 7 4 3 6 2 5 4 2 7
 1 5 1 7 3 4 6 5 3 2 4 7 2 6
 1 5 1 6 3 7 4 5 3 2 6 4 2 7
 1 5 1 4 6 7 3 5 4 2 3 6 2 7
 5 1 7 1 6 2 5 4 2 3 7 6 4 3
 4 1 7 1 6 4 2 5 3 2 7 6 3 5
 4 1 6 1 7 4 3 5 2 6 3 2 7 5
 7 1 3 1 6 4 3 5 7 2 4 6 2 5
 7 1 4 1 6 3 5 4 7 3 2 6 5 2
 6 1 5 1 7 3 4 6 5 3 2 4 7 2
 4 6 1 7 1 4 5 2 6 3 2 7 5 3
 7 3 1 6 1 3 4 5 7 2 6 4 2 5
 4 6 1 7 1 4 3 5 6 2 3 7 2 5
 5 6 1 7 1 3 5 4 6 3 2 7 4 2
 7 4 1 5 1 6 4 3 7 5 2 3 6 2
 5 7 1 4 1 6 5 3 4 7 2 3 6 2
 3 6 7 1 3 1 4 5 6 2 7 4 2 5
 5 7 4 1 6 1 5 4 3 7 2 6 3 2
 2 6 7 2 1 5 1 4 6 3 7 5 4 3
 4 5 6 7 1 4 1 5 3 6 2 7 3 2
 2 3 7 2 6 3 5 1 4 1 7 6 5 4
 3 4 5 7 3 6 4 1 5 1 2 7 6 2
 2 3 6 2 7 3 4 5 1 6 1 4 7 5
 5 2 4 7 2 6 5 4 1 3 1 7 6 3
 2 6 3 2 7 4 3 5 6 1 4 1 7 5
 2 6 3 2 5 7 3 4 6 1 5 1 4 7
 2 4 7 2 3 6 4 5 3 1 7 1 6 5
 5 2 7 3 2 6 5 3 4 1 7 1 6 4
 5 2 4 6 2 7 5 4 3 1 6 1 3 7
 3 5 7 2 3 6 2 5 4 1 7 1 6 4
 2 7 4 2 3 5 6 4 3 7 1 5 1 6
 2 5 6 2 3 7 4 5 3 6 1 4 1 7
 5 2 6 4 2 7 5 3 4 6 1 3 1 7
 5 7 2 3 6 2 5 3 4 7 1 6 1 4
 5 3 6 7 2 3 5 2 4 6 1 7 1 4
 3 4 6 7 3 2 4 5 2 6 1 7 1 5
 7 2 6 3 2 4 5 3 7 6 4 1 5 1
 7 2 4 6 2 3 5 4 7 3 6 1 5 1
 6 2 7 4 2 3 5 6 4 3 7 1 5 1
 7 2 4 5 2 6 3 4 7 5 3 1 6 1
 5 7 2 6 3 2 5 4 3 7 6 1 4 1
 7 3 6 2 5 3 2 4 7 6 5 1 4 1
 3 7 4 6 3 2 5 4 2 7 6 1 5 1
 3 5 7 4 3 6 2 5 4 2 7 1 6 1
 5 3 6 4 7 3 5 2 4 6 2 1 7 1
 4 6 3 5 7 4 3 2 6 5 2 1 7 1

// Include header file
#include <iostream>

using namespace std;
/*
   C++ Program
   Print all intervals of given number
*/
class Interval
{
	public:
		//  Display calculated intervals
		void display(int auxiliary[], int size)
		{
			for (int i = 0; i < size; ++i)
			{
				cout << " " << auxiliary[i];
			}
			cout << "\n";
		}
	// Find the elements from 1 to n in specific intervals
	void findIntervals(int auxiliary[], int element, int size, int n)
	{
		if (element > n)
		{
			// Display calculated result
			this->display(auxiliary, size);
			return;
		}
		for (int i = 0; i < size; ++i)
		{
			if (auxiliary[i] == 0 && i + element + 1 < size && auxiliary[i + element + 1] == 0)
			{
				// Insert element on particular distance
				auxiliary[i] = element;
				auxiliary[i + element + 1] = element;
				this->findIntervals(auxiliary, element + 1, size, n);
				// Reset value
				auxiliary[i] = 0;
				auxiliary[i + element + 1] = 0;
			}
		}
	}
	// Handles the request of printing number intervals
	void printIntervals(int intervals)
	{
		if (intervals <= 1)
		{
			return;
		}
		cout << " Intervals size " << intervals << " \n";
		// Used to store results
		int auxiliary[intervals *2];
		for (int i = 0; i < intervals *2; ++i)
		{
			auxiliary[i] = 0;
		}
		//  print all intervals
		this->findIntervals(auxiliary, 1, intervals *2, intervals);
		cout << "\n";
	}
};
int main()
{
	Interval task = Interval();
	// Test case
	task.printIntervals(4);
	task.printIntervals(7);
	return 0;
}

Output

 Intervals size 4
 4 1 3 1 2 4 3 2
 2 3 4 2 1 3 1 4

 Intervals size 7
 1 7 1 2 5 6 2 3 4 7 5 3 6 4
 1 7 1 2 6 4 2 5 3 7 4 6 3 5
 1 6 1 7 2 4 5 2 6 3 4 7 5 3
 1 5 1 6 7 2 4 5 2 3 6 4 7 3
 1 4 1 5 6 7 4 2 3 5 2 6 3 7
 1 4 1 6 7 3 4 5 2 3 6 2 7 5
 1 6 1 3 5 7 4 3 6 2 5 4 2 7
 1 5 1 7 3 4 6 5 3 2 4 7 2 6
 1 5 1 6 3 7 4 5 3 2 6 4 2 7
 1 5 1 4 6 7 3 5 4 2 3 6 2 7
 5 1 7 1 6 2 5 4 2 3 7 6 4 3
 4 1 7 1 6 4 2 5 3 2 7 6 3 5
 4 1 6 1 7 4 3 5 2 6 3 2 7 5
 7 1 3 1 6 4 3 5 7 2 4 6 2 5
 7 1 4 1 6 3 5 4 7 3 2 6 5 2
 6 1 5 1 7 3 4 6 5 3 2 4 7 2
 4 6 1 7 1 4 5 2 6 3 2 7 5 3
 7 3 1 6 1 3 4 5 7 2 6 4 2 5
 4 6 1 7 1 4 3 5 6 2 3 7 2 5
 5 6 1 7 1 3 5 4 6 3 2 7 4 2
 7 4 1 5 1 6 4 3 7 5 2 3 6 2
 5 7 1 4 1 6 5 3 4 7 2 3 6 2
 3 6 7 1 3 1 4 5 6 2 7 4 2 5
 5 7 4 1 6 1 5 4 3 7 2 6 3 2
 2 6 7 2 1 5 1 4 6 3 7 5 4 3
 4 5 6 7 1 4 1 5 3 6 2 7 3 2
 2 3 7 2 6 3 5 1 4 1 7 6 5 4
 3 4 5 7 3 6 4 1 5 1 2 7 6 2
 2 3 6 2 7 3 4 5 1 6 1 4 7 5
 5 2 4 7 2 6 5 4 1 3 1 7 6 3
 2 6 3 2 7 4 3 5 6 1 4 1 7 5
 2 6 3 2 5 7 3 4 6 1 5 1 4 7
 2 4 7 2 3 6 4 5 3 1 7 1 6 5
 5 2 7 3 2 6 5 3 4 1 7 1 6 4
 5 2 4 6 2 7 5 4 3 1 6 1 3 7
 3 5 7 2 3 6 2 5 4 1 7 1 6 4
 2 7 4 2 3 5 6 4 3 7 1 5 1 6
 2 5 6 2 3 7 4 5 3 6 1 4 1 7
 5 2 6 4 2 7 5 3 4 6 1 3 1 7
 5 7 2 3 6 2 5 3 4 7 1 6 1 4
 5 3 6 7 2 3 5 2 4 6 1 7 1 4
 3 4 6 7 3 2 4 5 2 6 1 7 1 5
 7 2 6 3 2 4 5 3 7 6 4 1 5 1
 7 2 4 6 2 3 5 4 7 3 6 1 5 1
 6 2 7 4 2 3 5 6 4 3 7 1 5 1
 7 2 4 5 2 6 3 4 7 5 3 1 6 1
 5 7 2 6 3 2 5 4 3 7 6 1 4 1
 7 3 6 2 5 3 2 4 7 6 5 1 4 1
 3 7 4 6 3 2 5 4 2 7 6 1 5 1
 3 5 7 4 3 6 2 5 4 2 7 1 6 1
 5 3 6 4 7 3 5 2 4 6 2 1 7 1
 4 6 3 5 7 4 3 2 6 5 2 1 7 1

// Include namespace system
using System;
/*
   C# Program
   Print all intervals of given number
*/
public class Interval
{
	//  Display calculated intervals
	public void display(int[] auxiliary, int size)
	{
		for (int i = 0; i < size; ++i)
		{
			Console.Write(" " + auxiliary[i]);
		}
		Console.Write("\n");
	}
	// Find the elements from 1 to n in specific intervals
	public void findIntervals(int[] auxiliary, int element, int size, int n)
	{
		if (element > n)
		{
			// Display calculated result
			display(auxiliary, size);
			return;
		}
		for (int i = 0; i < size; ++i)
		{
			if (auxiliary[i] == 0 && i + element + 1 < size && auxiliary[i + element + 1] == 0)
			{
				// Insert element on particular distance
				auxiliary[i] = element;
				auxiliary[i + element + 1] = element;
				findIntervals(auxiliary, element + 1, size, n);
				// Reset value
				auxiliary[i] = 0;
				auxiliary[i + element + 1] = 0;
			}
		}
	}
	// Handles the request of printing number intervals
	public void printIntervals(int intervals)
	{
		if (intervals <= 1)
		{
			return;
		}
		Console.Write(" Intervals size " + intervals + " \n");
		// Used to store results
		int[] auxiliary = new int[intervals * 2];
		for (int i = 0; i < intervals * 2; ++i)
		{
			auxiliary[i] = 0;
		}
		//  print all intervals
		findIntervals(auxiliary, 1, intervals * 2, intervals);
		Console.Write("\n");
	}
	public static void Main(String[] args)
	{
		Interval task = new Interval();
		// Test case
		task.printIntervals(4);
		task.printIntervals(7);
	}
}

Output

 Intervals size 4
 4 1 3 1 2 4 3 2
 2 3 4 2 1 3 1 4

 Intervals size 7
 1 7 1 2 5 6 2 3 4 7 5 3 6 4
 1 7 1 2 6 4 2 5 3 7 4 6 3 5
 1 6 1 7 2 4 5 2 6 3 4 7 5 3
 1 5 1 6 7 2 4 5 2 3 6 4 7 3
 1 4 1 5 6 7 4 2 3 5 2 6 3 7
 1 4 1 6 7 3 4 5 2 3 6 2 7 5
 1 6 1 3 5 7 4 3 6 2 5 4 2 7
 1 5 1 7 3 4 6 5 3 2 4 7 2 6
 1 5 1 6 3 7 4 5 3 2 6 4 2 7
 1 5 1 4 6 7 3 5 4 2 3 6 2 7
 5 1 7 1 6 2 5 4 2 3 7 6 4 3
 4 1 7 1 6 4 2 5 3 2 7 6 3 5
 4 1 6 1 7 4 3 5 2 6 3 2 7 5
 7 1 3 1 6 4 3 5 7 2 4 6 2 5
 7 1 4 1 6 3 5 4 7 3 2 6 5 2
 6 1 5 1 7 3 4 6 5 3 2 4 7 2
 4 6 1 7 1 4 5 2 6 3 2 7 5 3
 7 3 1 6 1 3 4 5 7 2 6 4 2 5
 4 6 1 7 1 4 3 5 6 2 3 7 2 5
 5 6 1 7 1 3 5 4 6 3 2 7 4 2
 7 4 1 5 1 6 4 3 7 5 2 3 6 2
 5 7 1 4 1 6 5 3 4 7 2 3 6 2
 3 6 7 1 3 1 4 5 6 2 7 4 2 5
 5 7 4 1 6 1 5 4 3 7 2 6 3 2
 2 6 7 2 1 5 1 4 6 3 7 5 4 3
 4 5 6 7 1 4 1 5 3 6 2 7 3 2
 2 3 7 2 6 3 5 1 4 1 7 6 5 4
 3 4 5 7 3 6 4 1 5 1 2 7 6 2
 2 3 6 2 7 3 4 5 1 6 1 4 7 5
 5 2 4 7 2 6 5 4 1 3 1 7 6 3
 2 6 3 2 7 4 3 5 6 1 4 1 7 5
 2 6 3 2 5 7 3 4 6 1 5 1 4 7
 2 4 7 2 3 6 4 5 3 1 7 1 6 5
 5 2 7 3 2 6 5 3 4 1 7 1 6 4
 5 2 4 6 2 7 5 4 3 1 6 1 3 7
 3 5 7 2 3 6 2 5 4 1 7 1 6 4
 2 7 4 2 3 5 6 4 3 7 1 5 1 6
 2 5 6 2 3 7 4 5 3 6 1 4 1 7
 5 2 6 4 2 7 5 3 4 6 1 3 1 7
 5 7 2 3 6 2 5 3 4 7 1 6 1 4
 5 3 6 7 2 3 5 2 4 6 1 7 1 4
 3 4 6 7 3 2 4 5 2 6 1 7 1 5
 7 2 6 3 2 4 5 3 7 6 4 1 5 1
 7 2 4 6 2 3 5 4 7 3 6 1 5 1
 6 2 7 4 2 3 5 6 4 3 7 1 5 1
 7 2 4 5 2 6 3 4 7 5 3 1 6 1
 5 7 2 6 3 2 5 4 3 7 6 1 4 1
 7 3 6 2 5 3 2 4 7 6 5 1 4 1
 3 7 4 6 3 2 5 4 2 7 6 1 5 1
 3 5 7 4 3 6 2 5 4 2 7 1 6 1
 5 3 6 4 7 3 5 2 4 6 2 1 7 1
 4 6 3 5 7 4 3 2 6 5 2 1 7 1

<?php
/*
   Php Program
   Print all intervals of given number
*/
class Interval
{
	//  Display calculated intervals
	public	function display( & $auxiliary, $size)
	{
		for ($i = 0; $i < $size; ++$i)
		{
			echo " ". $auxiliary[$i];
		}
		echo "\n";
	}
	// Find the elements from 1 to n in specific intervals
	public	function findIntervals( & $auxiliary, $element, $size, $n)
	{
		if ($element > $n)
		{
			// Display calculated result
			$this->display($auxiliary, $size);
			return;
		}
		for ($i = 0; $i < $size; ++$i)
		{
			if ($auxiliary[$i] == 0 && $i + $element + 1 < $size && $auxiliary[$i + $element + 1] == 0)
			{
				// Insert element on particular distance
				$auxiliary[$i] = $element;
				$auxiliary[$i + $element + 1] = $element;
				$this->findIntervals($auxiliary, $element + 1, $size, $n);
				// Reset value
				$auxiliary[$i] = 0;
				$auxiliary[$i + $element + 1] = 0;
			}
		}
	}
	// Handles the request of printing number intervals
	public	function printIntervals($intervals)
	{
		if ($intervals <= 1)
		{
			return;
		}
		echo " Intervals size ". $intervals ." \n";
		// Used to store results
		$auxiliary = array_fill(0, $intervals * 2, 0);
		for ($i = 0; $i < $intervals * 2; ++$i)
		{
			$auxiliary[$i] = 0;
		}
		//  print all intervals
		$this->findIntervals($auxiliary, 1, $intervals * 2, $intervals);
		echo "\n";
	}
}

function main()
{
	$task = new Interval();
	// Test case
	$task->printIntervals(4);
	$task->printIntervals(7);
}
main();

Output

 Intervals size 4
 4 1 3 1 2 4 3 2
 2 3 4 2 1 3 1 4

 Intervals size 7
 1 7 1 2 5 6 2 3 4 7 5 3 6 4
 1 7 1 2 6 4 2 5 3 7 4 6 3 5
 1 6 1 7 2 4 5 2 6 3 4 7 5 3
 1 5 1 6 7 2 4 5 2 3 6 4 7 3
 1 4 1 5 6 7 4 2 3 5 2 6 3 7
 1 4 1 6 7 3 4 5 2 3 6 2 7 5
 1 6 1 3 5 7 4 3 6 2 5 4 2 7
 1 5 1 7 3 4 6 5 3 2 4 7 2 6
 1 5 1 6 3 7 4 5 3 2 6 4 2 7
 1 5 1 4 6 7 3 5 4 2 3 6 2 7
 5 1 7 1 6 2 5 4 2 3 7 6 4 3
 4 1 7 1 6 4 2 5 3 2 7 6 3 5
 4 1 6 1 7 4 3 5 2 6 3 2 7 5
 7 1 3 1 6 4 3 5 7 2 4 6 2 5
 7 1 4 1 6 3 5 4 7 3 2 6 5 2
 6 1 5 1 7 3 4 6 5 3 2 4 7 2
 4 6 1 7 1 4 5 2 6 3 2 7 5 3
 7 3 1 6 1 3 4 5 7 2 6 4 2 5
 4 6 1 7 1 4 3 5 6 2 3 7 2 5
 5 6 1 7 1 3 5 4 6 3 2 7 4 2
 7 4 1 5 1 6 4 3 7 5 2 3 6 2
 5 7 1 4 1 6 5 3 4 7 2 3 6 2
 3 6 7 1 3 1 4 5 6 2 7 4 2 5
 5 7 4 1 6 1 5 4 3 7 2 6 3 2
 2 6 7 2 1 5 1 4 6 3 7 5 4 3
 4 5 6 7 1 4 1 5 3 6 2 7 3 2
 2 3 7 2 6 3 5 1 4 1 7 6 5 4
 3 4 5 7 3 6 4 1 5 1 2 7 6 2
 2 3 6 2 7 3 4 5 1 6 1 4 7 5
 5 2 4 7 2 6 5 4 1 3 1 7 6 3
 2 6 3 2 7 4 3 5 6 1 4 1 7 5
 2 6 3 2 5 7 3 4 6 1 5 1 4 7
 2 4 7 2 3 6 4 5 3 1 7 1 6 5
 5 2 7 3 2 6 5 3 4 1 7 1 6 4
 5 2 4 6 2 7 5 4 3 1 6 1 3 7
 3 5 7 2 3 6 2 5 4 1 7 1 6 4
 2 7 4 2 3 5 6 4 3 7 1 5 1 6
 2 5 6 2 3 7 4 5 3 6 1 4 1 7
 5 2 6 4 2 7 5 3 4 6 1 3 1 7
 5 7 2 3 6 2 5 3 4 7 1 6 1 4
 5 3 6 7 2 3 5 2 4 6 1 7 1 4
 3 4 6 7 3 2 4 5 2 6 1 7 1 5
 7 2 6 3 2 4 5 3 7 6 4 1 5 1
 7 2 4 6 2 3 5 4 7 3 6 1 5 1
 6 2 7 4 2 3 5 6 4 3 7 1 5 1
 7 2 4 5 2 6 3 4 7 5 3 1 6 1
 5 7 2 6 3 2 5 4 3 7 6 1 4 1
 7 3 6 2 5 3 2 4 7 6 5 1 4 1
 3 7 4 6 3 2 5 4 2 7 6 1 5 1
 3 5 7 4 3 6 2 5 4 2 7 1 6 1
 5 3 6 4 7 3 5 2 4 6 2 1 7 1
 4 6 3 5 7 4 3 2 6 5 2 1 7 1

/*
   Node Js Program
   Print all intervals of given number
*/
class Interval
{
	//  Display calculated intervals
	display(auxiliary, size)
	{
		for (var i = 0; i < size; ++i)
		{
			process.stdout.write(" " + auxiliary[i]);
		}
		process.stdout.write("\n");
	}
	// Find the elements from 1 to n in specific intervals
	findIntervals(auxiliary, element, size, n)
	{
		if (element > n)
		{
			// Display calculated result
			this.display(auxiliary, size);
			return;
		}
		for (var i = 0; i < size; ++i)
		{
			if (auxiliary[i] == 0 && i + element + 1 < size && auxiliary[i + element + 1] == 0)
			{
				// Insert element on particular distance
				auxiliary[i] = element;
				auxiliary[i + element + 1] = element;
				this.findIntervals(auxiliary, element + 1, size, n);
				// Reset value
				auxiliary[i] = 0;
				auxiliary[i + element + 1] = 0;
			}
		}
	}
	// Handles the request of printing number intervals
	printIntervals(intervals)
	{
		if (intervals <= 1)
		{
			return;
		}
		process.stdout.write(" Intervals size " + intervals + " \n");
		// Used to store results
		var auxiliary = Array(intervals * 2).fill(0);
		for (var i = 0; i < intervals * 2; ++i)
		{
			auxiliary[i] = 0;
		}
		//  print all intervals
		this.findIntervals(auxiliary, 1, intervals * 2, intervals);
		process.stdout.write("\n");
	}
}

function main()
{
	var task = new Interval();
	// Test case
	task.printIntervals(4);
	task.printIntervals(7);
}
main();

Output

 Intervals size 4
 4 1 3 1 2 4 3 2
 2 3 4 2 1 3 1 4

 Intervals size 7
 1 7 1 2 5 6 2 3 4 7 5 3 6 4
 1 7 1 2 6 4 2 5 3 7 4 6 3 5
 1 6 1 7 2 4 5 2 6 3 4 7 5 3
 1 5 1 6 7 2 4 5 2 3 6 4 7 3
 1 4 1 5 6 7 4 2 3 5 2 6 3 7
 1 4 1 6 7 3 4 5 2 3 6 2 7 5
 1 6 1 3 5 7 4 3 6 2 5 4 2 7
 1 5 1 7 3 4 6 5 3 2 4 7 2 6
 1 5 1 6 3 7 4 5 3 2 6 4 2 7
 1 5 1 4 6 7 3 5 4 2 3 6 2 7
 5 1 7 1 6 2 5 4 2 3 7 6 4 3
 4 1 7 1 6 4 2 5 3 2 7 6 3 5
 4 1 6 1 7 4 3 5 2 6 3 2 7 5
 7 1 3 1 6 4 3 5 7 2 4 6 2 5
 7 1 4 1 6 3 5 4 7 3 2 6 5 2
 6 1 5 1 7 3 4 6 5 3 2 4 7 2
 4 6 1 7 1 4 5 2 6 3 2 7 5 3
 7 3 1 6 1 3 4 5 7 2 6 4 2 5
 4 6 1 7 1 4 3 5 6 2 3 7 2 5
 5 6 1 7 1 3 5 4 6 3 2 7 4 2
 7 4 1 5 1 6 4 3 7 5 2 3 6 2
 5 7 1 4 1 6 5 3 4 7 2 3 6 2
 3 6 7 1 3 1 4 5 6 2 7 4 2 5
 5 7 4 1 6 1 5 4 3 7 2 6 3 2
 2 6 7 2 1 5 1 4 6 3 7 5 4 3
 4 5 6 7 1 4 1 5 3 6 2 7 3 2
 2 3 7 2 6 3 5 1 4 1 7 6 5 4
 3 4 5 7 3 6 4 1 5 1 2 7 6 2
 2 3 6 2 7 3 4 5 1 6 1 4 7 5
 5 2 4 7 2 6 5 4 1 3 1 7 6 3
 2 6 3 2 7 4 3 5 6 1 4 1 7 5
 2 6 3 2 5 7 3 4 6 1 5 1 4 7
 2 4 7 2 3 6 4 5 3 1 7 1 6 5
 5 2 7 3 2 6 5 3 4 1 7 1 6 4
 5 2 4 6 2 7 5 4 3 1 6 1 3 7
 3 5 7 2 3 6 2 5 4 1 7 1 6 4
 2 7 4 2 3 5 6 4 3 7 1 5 1 6
 2 5 6 2 3 7 4 5 3 6 1 4 1 7
 5 2 6 4 2 7 5 3 4 6 1 3 1 7
 5 7 2 3 6 2 5 3 4 7 1 6 1 4
 5 3 6 7 2 3 5 2 4 6 1 7 1 4
 3 4 6 7 3 2 4 5 2 6 1 7 1 5
 7 2 6 3 2 4 5 3 7 6 4 1 5 1
 7 2 4 6 2 3 5 4 7 3 6 1 5 1
 6 2 7 4 2 3 5 6 4 3 7 1 5 1
 7 2 4 5 2 6 3 4 7 5 3 1 6 1
 5 7 2 6 3 2 5 4 3 7 6 1 4 1
 7 3 6 2 5 3 2 4 7 6 5 1 4 1
 3 7 4 6 3 2 5 4 2 7 6 1 5 1
 3 5 7 4 3 6 2 5 4 2 7 1 6 1
 5 3 6 4 7 3 5 2 4 6 2 1 7 1
 4 6 3 5 7 4 3 2 6 5 2 1 7 1

#    Python 3 Program
#    Print all intervals of given number

class Interval :
	#   Display calculated intervals
	def display(self, auxiliary, size) :
		i = 0
		while (i < size) :
			print(" ", auxiliary[i], end = "")
			i += 1
		
		print(end = "\n")
	
	#  Find the elements from 1 to n in specific intervals
	def findIntervals(self, auxiliary, element, size, n) :
		if (element > n) :
			#  Display calculated result
			self.display(auxiliary, size)
			return
		
		i = 0
		while (i < size) :
			if (auxiliary[i] == 0 and i + element + 1 < size and auxiliary[i + element + 1] == 0) :
				#  Insert element on particular distance
				auxiliary[i] = element
				auxiliary[i + element + 1] = element
				self.findIntervals(auxiliary, element + 1, size, n)
				#  Reset value
				auxiliary[i] = 0
				auxiliary[i + element + 1] = 0
			
			i += 1
		
	
	#  Handles the request of printing number intervals
	def printIntervals(self, intervals) :
		if (intervals <= 1) :
			return
		
		print(" Intervals size ", intervals ," ")
		#  Used to store results
		auxiliary = [0] * (intervals * 2)
		#   print all intervals
		self.findIntervals(auxiliary, 1, intervals * 2, intervals)
		print(end = "\n")
	

def main() :
	task = Interval()
	#  Test case
	task.printIntervals(4)
	task.printIntervals(7)

if __name__ == "__main__": main()

Output

 Intervals size  4
  4  1  3  1  2  4  3  2
  2  3  4  2  1  3  1  4

 Intervals size  7
  1  7  1  2  5  6  2  3  4  7  5  3  6  4
  1  7  1  2  6  4  2  5  3  7  4  6  3  5
  1  6  1  7  2  4  5  2  6  3  4  7  5  3
  1  5  1  6  7  2  4  5  2  3  6  4  7  3
  1  4  1  5  6  7  4  2  3  5  2  6  3  7
  1  4  1  6  7  3  4  5  2  3  6  2  7  5
  1  6  1  3  5  7  4  3  6  2  5  4  2  7
  1  5  1  7  3  4  6  5  3  2  4  7  2  6
  1  5  1  6  3  7  4  5  3  2  6  4  2  7
  1  5  1  4  6  7  3  5  4  2  3  6  2  7
  5  1  7  1  6  2  5  4  2  3  7  6  4  3
  4  1  7  1  6  4  2  5  3  2  7  6  3  5
  4  1  6  1  7  4  3  5  2  6  3  2  7  5
  7  1  3  1  6  4  3  5  7  2  4  6  2  5
  7  1  4  1  6  3  5  4  7  3  2  6  5  2
  6  1  5  1  7  3  4  6  5  3  2  4  7  2
  4  6  1  7  1  4  5  2  6  3  2  7  5  3
  7  3  1  6  1  3  4  5  7  2  6  4  2  5
  4  6  1  7  1  4  3  5  6  2  3  7  2  5
  5  6  1  7  1  3  5  4  6  3  2  7  4  2
  7  4  1  5  1  6  4  3  7  5  2  3  6  2
  5  7  1  4  1  6  5  3  4  7  2  3  6  2
  3  6  7  1  3  1  4  5  6  2  7  4  2  5
  5  7  4  1  6  1  5  4  3  7  2  6  3  2
  2  6  7  2  1  5  1  4  6  3  7  5  4  3
  4  5  6  7  1  4  1  5  3  6  2  7  3  2
  2  3  7  2  6  3  5  1  4  1  7  6  5  4
  3  4  5  7  3  6  4  1  5  1  2  7  6  2
  2  3  6  2  7  3  4  5  1  6  1  4  7  5
  5  2  4  7  2  6  5  4  1  3  1  7  6  3
  2  6  3  2  7  4  3  5  6  1  4  1  7  5
  2  6  3  2  5  7  3  4  6  1  5  1  4  7
  2  4  7  2  3  6  4  5  3  1  7  1  6  5
  5  2  7  3  2  6  5  3  4  1  7  1  6  4
  5  2  4  6  2  7  5  4  3  1  6  1  3  7
  3  5  7  2  3  6  2  5  4  1  7  1  6  4
  2  7  4  2  3  5  6  4  3  7  1  5  1  6
  2  5  6  2  3  7  4  5  3  6  1  4  1  7
  5  2  6  4  2  7  5  3  4  6  1  3  1  7
  5  7  2  3  6  2  5  3  4  7  1  6  1  4
  5  3  6  7  2  3  5  2  4  6  1  7  1  4
  3  4  6  7  3  2  4  5  2  6  1  7  1  5
  7  2  6  3  2  4  5  3  7  6  4  1  5  1
  7  2  4  6  2  3  5  4  7  3  6  1  5  1
  6  2  7  4  2  3  5  6  4  3  7  1  5  1
  7  2  4  5  2  6  3  4  7  5  3  1  6  1
  5  7  2  6  3  2  5  4  3  7  6  1  4  1
  7  3  6  2  5  3  2  4  7  6  5  1  4  1
  3  7  4  6  3  2  5  4  2  7  6  1  5  1
  3  5  7  4  3  6  2  5  4  2  7  1  6  1
  5  3  6  4  7  3  5  2  4  6  2  1  7  1
  4  6  3  5  7  4  3  2  6  5  2  1  7  1

#    Ruby Program
#    Print all intervals of given number

class Interval 
	#   Display calculated intervals
	def display(auxiliary, size) 
		i = 0
		while (i < size) 
			print(" ", auxiliary[i])
			i += 1
		end

		print("\n")
	end

	#  Find the elements from 1 to n in specific intervals
	def findIntervals(auxiliary, element, size, n) 
		if (element > n) 
			#  Display calculated result
			self.display(auxiliary, size)
			return
		end

		i = 0
		while (i < size) 
			if (auxiliary[i] == 0 && i + element + 1 < size && auxiliary[i + element + 1] == 0) 
				#  Insert element on particular distance
				auxiliary[i] = element
				auxiliary[i + element + 1] = element
				self.findIntervals(auxiliary, element + 1, size, n)
				#  Reset value
				auxiliary[i] = 0
				auxiliary[i + element + 1] = 0
			end

			i += 1
		end

	end

	#  Handles the request of printing number intervals
	def printIntervals(intervals) 
		if (intervals <= 1) 
			return
		end

		print(" Intervals size ", intervals ," \n")
		#  Used to store results
		auxiliary = Array.new(intervals * 2) {0}
		#   print all intervals
		self.findIntervals(auxiliary, 1, intervals * 2, intervals)
		print("\n")
	end

end

def main() 
	task = Interval.new()
	#  Test case
	task.printIntervals(4)
	task.printIntervals(7)
end

main()

Output

 Intervals size 4 
 4 1 3 1 2 4 3 2
 2 3 4 2 1 3 1 4

 Intervals size 7 
 1 7 1 2 5 6 2 3 4 7 5 3 6 4
 1 7 1 2 6 4 2 5 3 7 4 6 3 5
 1 6 1 7 2 4 5 2 6 3 4 7 5 3
 1 5 1 6 7 2 4 5 2 3 6 4 7 3
 1 4 1 5 6 7 4 2 3 5 2 6 3 7
 1 4 1 6 7 3 4 5 2 3 6 2 7 5
 1 6 1 3 5 7 4 3 6 2 5 4 2 7
 1 5 1 7 3 4 6 5 3 2 4 7 2 6
 1 5 1 6 3 7 4 5 3 2 6 4 2 7
 1 5 1 4 6 7 3 5 4 2 3 6 2 7
 5 1 7 1 6 2 5 4 2 3 7 6 4 3
 4 1 7 1 6 4 2 5 3 2 7 6 3 5
 4 1 6 1 7 4 3 5 2 6 3 2 7 5
 7 1 3 1 6 4 3 5 7 2 4 6 2 5
 7 1 4 1 6 3 5 4 7 3 2 6 5 2
 6 1 5 1 7 3 4 6 5 3 2 4 7 2
 4 6 1 7 1 4 5 2 6 3 2 7 5 3
 7 3 1 6 1 3 4 5 7 2 6 4 2 5
 4 6 1 7 1 4 3 5 6 2 3 7 2 5
 5 6 1 7 1 3 5 4 6 3 2 7 4 2
 7 4 1 5 1 6 4 3 7 5 2 3 6 2
 5 7 1 4 1 6 5 3 4 7 2 3 6 2
 3 6 7 1 3 1 4 5 6 2 7 4 2 5
 5 7 4 1 6 1 5 4 3 7 2 6 3 2
 2 6 7 2 1 5 1 4 6 3 7 5 4 3
 4 5 6 7 1 4 1 5 3 6 2 7 3 2
 2 3 7 2 6 3 5 1 4 1 7 6 5 4
 3 4 5 7 3 6 4 1 5 1 2 7 6 2
 2 3 6 2 7 3 4 5 1 6 1 4 7 5
 5 2 4 7 2 6 5 4 1 3 1 7 6 3
 2 6 3 2 7 4 3 5 6 1 4 1 7 5
 2 6 3 2 5 7 3 4 6 1 5 1 4 7
 2 4 7 2 3 6 4 5 3 1 7 1 6 5
 5 2 7 3 2 6 5 3 4 1 7 1 6 4
 5 2 4 6 2 7 5 4 3 1 6 1 3 7
 3 5 7 2 3 6 2 5 4 1 7 1 6 4
 2 7 4 2 3 5 6 4 3 7 1 5 1 6
 2 5 6 2 3 7 4 5 3 6 1 4 1 7
 5 2 6 4 2 7 5 3 4 6 1 3 1 7
 5 7 2 3 6 2 5 3 4 7 1 6 1 4
 5 3 6 7 2 3 5 2 4 6 1 7 1 4
 3 4 6 7 3 2 4 5 2 6 1 7 1 5
 7 2 6 3 2 4 5 3 7 6 4 1 5 1
 7 2 4 6 2 3 5 4 7 3 6 1 5 1
 6 2 7 4 2 3 5 6 4 3 7 1 5 1
 7 2 4 5 2 6 3 4 7 5 3 1 6 1
 5 7 2 6 3 2 5 4 3 7 6 1 4 1
 7 3 6 2 5 3 2 4 7 6 5 1 4 1
 3 7 4 6 3 2 5 4 2 7 6 1 5 1
 3 5 7 4 3 6 2 5 4 2 7 1 6 1
 5 3 6 4 7 3 5 2 4 6 2 1 7 1
 4 6 3 5 7 4 3 2 6 5 2 1 7 1

/*
   Scala Program
   Print all intervals of given number
*/
class Interval
{
	//  Display calculated intervals
	def display(auxiliary: Array[Int], size: Int): Unit = {
		var i: Int = 0;
		while (i < size)
		{
			print(" " + auxiliary(i));
			i += 1;
		}
		print("\n");
	}
	// Find the elements from 1 to n in specific intervals
	def findIntervals(auxiliary: Array[Int], element: Int, size: Int, n: Int): Unit = {
		if (element > n)
		{
			// Display calculated result
			this.display(auxiliary, size);
			return;
		}
		var i: Int = 0;
		while (i < size)
		{
			if (auxiliary(i) == 0 && i + element + 1 < size && auxiliary(i + element + 1) == 0)
			{
				// Insert element on particular distance
				auxiliary(i) = element;
				auxiliary(i + element + 1) = element;
				this.findIntervals(auxiliary, element + 1, size, n);
				// Reset value
				auxiliary(i) = 0;
				auxiliary(i + element + 1) = 0;
			}
			i += 1;
		}
	}
	// Handles the request of printing number intervals
	def printIntervals(intervals: Int): Unit = {
		if (intervals <= 1)
		{
			return;
		}
		print(" Intervals size " + intervals + " \n");
		// Used to store results
		var auxiliary: Array[Int] = Array.fill[Int](intervals * 2)(0);
		//  print all intervals
		this.findIntervals(auxiliary, 1, intervals * 2, intervals);
		print("\n");
	}
}
object Main
{
	def main(args: Array[String]): Unit = {
		var task: Interval = new Interval();
		// Test case
		task.printIntervals(4);
		task.printIntervals(7);
	}
}

Output

 Intervals size 4
 4 1 3 1 2 4 3 2
 2 3 4 2 1 3 1 4

 Intervals size 7
 1 7 1 2 5 6 2 3 4 7 5 3 6 4
 1 7 1 2 6 4 2 5 3 7 4 6 3 5
 1 6 1 7 2 4 5 2 6 3 4 7 5 3
 1 5 1 6 7 2 4 5 2 3 6 4 7 3
 1 4 1 5 6 7 4 2 3 5 2 6 3 7
 1 4 1 6 7 3 4 5 2 3 6 2 7 5
 1 6 1 3 5 7 4 3 6 2 5 4 2 7
 1 5 1 7 3 4 6 5 3 2 4 7 2 6
 1 5 1 6 3 7 4 5 3 2 6 4 2 7
 1 5 1 4 6 7 3 5 4 2 3 6 2 7
 5 1 7 1 6 2 5 4 2 3 7 6 4 3
 4 1 7 1 6 4 2 5 3 2 7 6 3 5
 4 1 6 1 7 4 3 5 2 6 3 2 7 5
 7 1 3 1 6 4 3 5 7 2 4 6 2 5
 7 1 4 1 6 3 5 4 7 3 2 6 5 2
 6 1 5 1 7 3 4 6 5 3 2 4 7 2
 4 6 1 7 1 4 5 2 6 3 2 7 5 3
 7 3 1 6 1 3 4 5 7 2 6 4 2 5
 4 6 1 7 1 4 3 5 6 2 3 7 2 5
 5 6 1 7 1 3 5 4 6 3 2 7 4 2
 7 4 1 5 1 6 4 3 7 5 2 3 6 2
 5 7 1 4 1 6 5 3 4 7 2 3 6 2
 3 6 7 1 3 1 4 5 6 2 7 4 2 5
 5 7 4 1 6 1 5 4 3 7 2 6 3 2
 2 6 7 2 1 5 1 4 6 3 7 5 4 3
 4 5 6 7 1 4 1 5 3 6 2 7 3 2
 2 3 7 2 6 3 5 1 4 1 7 6 5 4
 3 4 5 7 3 6 4 1 5 1 2 7 6 2
 2 3 6 2 7 3 4 5 1 6 1 4 7 5
 5 2 4 7 2 6 5 4 1 3 1 7 6 3
 2 6 3 2 7 4 3 5 6 1 4 1 7 5
 2 6 3 2 5 7 3 4 6 1 5 1 4 7
 2 4 7 2 3 6 4 5 3 1 7 1 6 5
 5 2 7 3 2 6 5 3 4 1 7 1 6 4
 5 2 4 6 2 7 5 4 3 1 6 1 3 7
 3 5 7 2 3 6 2 5 4 1 7 1 6 4
 2 7 4 2 3 5 6 4 3 7 1 5 1 6
 2 5 6 2 3 7 4 5 3 6 1 4 1 7
 5 2 6 4 2 7 5 3 4 6 1 3 1 7
 5 7 2 3 6 2 5 3 4 7 1 6 1 4
 5 3 6 7 2 3 5 2 4 6 1 7 1 4
 3 4 6 7 3 2 4 5 2 6 1 7 1 5
 7 2 6 3 2 4 5 3 7 6 4 1 5 1
 7 2 4 6 2 3 5 4 7 3 6 1 5 1
 6 2 7 4 2 3 5 6 4 3 7 1 5 1
 7 2 4 5 2 6 3 4 7 5 3 1 6 1
 5 7 2 6 3 2 5 4 3 7 6 1 4 1
 7 3 6 2 5 3 2 4 7 6 5 1 4 1
 3 7 4 6 3 2 5 4 2 7 6 1 5 1
 3 5 7 4 3 6 2 5 4 2 7 1 6 1
 5 3 6 4 7 3 5 2 4 6 2 1 7 1
 4 6 3 5 7 4 3 2 6 5 2 1 7 1

/*
   Swift 4 Program
   Print all intervals of given number
*/
class Interval
{
	//  Display calculated intervals
	func display(_ auxiliary: [Int], _ size: Int)
	{
		var i: Int = 0;
		while (i < size)
		{
			print(" ", auxiliary[i], terminator: "");
			i += 1;
		}
		print(terminator: "\n");
	}
	// Find the elements from 1 to n in specific intervals
	func findIntervals(_ auxiliary: inout[Int], _ element: Int, _ size: Int, _ n: Int)
	{
		if (element > n)
		{
			// Display calculated result
			self.display(auxiliary, size);
			return;
		}
		var i: Int = 0;
		while (i < size)
		{
			if (auxiliary[i] == 0 && i + element + 1 < size && auxiliary[i + element + 1] == 0)
			{
				// Insert element on particular distance
				auxiliary[i] = element;
				auxiliary[i + element + 1] = element;
				self.findIntervals(&auxiliary, element + 1, size, n);
				// Reset value
				auxiliary[i] = 0;
				auxiliary[i + element + 1] = 0;
			}
			i += 1;
		}
	}
	// Handles the request of printing number intervals
	func printIntervals(_ intervals: Int)
	{
		if (intervals <= 1)
		{
			return;
		}
		print(" Intervals size ", intervals ," ");
		// Used to store results
		var auxiliary: [Int] = Array(repeating: 0, count: intervals * 2);
		//  print all intervals
		self.findIntervals(&auxiliary, 1, intervals * 2, intervals);
		print(terminator: "\n");
	}
}
func main()
{
	let task: Interval = Interval();
	// Test case
	task.printIntervals(4);
	task.printIntervals(7);
}
main();

Output

 Intervals size  4
  4  1  3  1  2  4  3  2
  2  3  4  2  1  3  1  4

 Intervals size  7
  1  7  1  2  5  6  2  3  4  7  5  3  6  4
  1  7  1  2  6  4  2  5  3  7  4  6  3  5
  1  6  1  7  2  4  5  2  6  3  4  7  5  3
  1  5  1  6  7  2  4  5  2  3  6  4  7  3
  1  4  1  5  6  7  4  2  3  5  2  6  3  7
  1  4  1  6  7  3  4  5  2  3  6  2  7  5
  1  6  1  3  5  7  4  3  6  2  5  4  2  7
  1  5  1  7  3  4  6  5  3  2  4  7  2  6
  1  5  1  6  3  7  4  5  3  2  6  4  2  7
  1  5  1  4  6  7  3  5  4  2  3  6  2  7
  5  1  7  1  6  2  5  4  2  3  7  6  4  3
  4  1  7  1  6  4  2  5  3  2  7  6  3  5
  4  1  6  1  7  4  3  5  2  6  3  2  7  5
  7  1  3  1  6  4  3  5  7  2  4  6  2  5
  7  1  4  1  6  3  5  4  7  3  2  6  5  2
  6  1  5  1  7  3  4  6  5  3  2  4  7  2
  4  6  1  7  1  4  5  2  6  3  2  7  5  3
  7  3  1  6  1  3  4  5  7  2  6  4  2  5
  4  6  1  7  1  4  3  5  6  2  3  7  2  5
  5  6  1  7  1  3  5  4  6  3  2  7  4  2
  7  4  1  5  1  6  4  3  7  5  2  3  6  2
  5  7  1  4  1  6  5  3  4  7  2  3  6  2
  3  6  7  1  3  1  4  5  6  2  7  4  2  5
  5  7  4  1  6  1  5  4  3  7  2  6  3  2
  2  6  7  2  1  5  1  4  6  3  7  5  4  3
  4  5  6  7  1  4  1  5  3  6  2  7  3  2
  2  3  7  2  6  3  5  1  4  1  7  6  5  4
  3  4  5  7  3  6  4  1  5  1  2  7  6  2
  2  3  6  2  7  3  4  5  1  6  1  4  7  5
  5  2  4  7  2  6  5  4  1  3  1  7  6  3
  2  6  3  2  7  4  3  5  6  1  4  1  7  5
  2  6  3  2  5  7  3  4  6  1  5  1  4  7
  2  4  7  2  3  6  4  5  3  1  7  1  6  5
  5  2  7  3  2  6  5  3  4  1  7  1  6  4
  5  2  4  6  2  7  5  4  3  1  6  1  3  7
  3  5  7  2  3  6  2  5  4  1  7  1  6  4
  2  7  4  2  3  5  6  4  3  7  1  5  1  6
  2  5  6  2  3  7  4  5  3  6  1  4  1  7
  5  2  6  4  2  7  5  3  4  6  1  3  1  7
  5  7  2  3  6  2  5  3  4  7  1  6  1  4
  5  3  6  7  2  3  5  2  4  6  1  7  1  4
  3  4  6  7  3  2  4  5  2  6  1  7  1  5
  7  2  6  3  2  4  5  3  7  6  4  1  5  1
  7  2  4  6  2  3  5  4  7  3  6  1  5  1
  6  2  7  4  2  3  5  6  4  3  7  1  5  1
  7  2  4  5  2  6  3  4  7  5  3  1  6  1
  5  7  2  6  3  2  5  4  3  7  6  1  4  1
  7  3  6  2  5  3  2  4  7  6  5  1  4  1
  3  7  4  6  3  2  5  4  2  7  6  1  5  1
  3  5  7  4  3  6  2  5  4  2  7  1  6  1
  5  3  6  4  7  3  5  2  4  6  2  1  7  1
  4  6  3  5  7  4  3  2  6  5  2  1  7  1

/*
   Kotlin Program
   Print all intervals of given number
*/
class Interval
{
	//  Display calculated intervals
	fun display(auxiliary: Array<Int> , size: Int): Unit
	{
		var i: Int = 0;
		while (i < size)
		{
			print(" " + auxiliary[i]);
			i += 1;
		}
		print("\n");
	}
	// Find the elements from 1 to n in specific intervals
	fun findIntervals(auxiliary: Array<Int> , element: Int, size: Int, n: Int): Unit
	{
		if (element > n)
		{
			// Display calculated result
			this.display(auxiliary, size);
			return;
		}
		var i: Int = 0;
		while (i < size)
		{
			if (auxiliary[i] == 0 && i + element + 1 < size && auxiliary[i + element + 1] == 0)
			{
				// Insert element on particular distance
				auxiliary[i] = element;
				auxiliary[i + element + 1] = element;
				this.findIntervals(auxiliary, element + 1, size, n);
				// Reset value
				auxiliary[i] = 0;
				auxiliary[i + element + 1] = 0;
			}
			i += 1;
		}
	}
	// Handles the request of printing number intervals
	fun printIntervals(intervals: Int): Unit
	{
		if (intervals <= 1)
		{
			return;
		}
		print(" Intervals size " + intervals + " \n");
		// Used to store results
		var auxiliary: Array < Int > = Array(intervals * 2)
		{
			0
		};
		//  print all intervals
		this.findIntervals(auxiliary, 1, intervals * 2, intervals);
		print("\n");
	}
}
fun main(args: Array < String > ): Unit
{
	var task: Interval = Interval();
	// Test case
	task.printIntervals(4);
	task.printIntervals(7);
}

Output

 Intervals size 4
 4 1 3 1 2 4 3 2
 2 3 4 2 1 3 1 4

 Intervals size 7
 1 7 1 2 5 6 2 3 4 7 5 3 6 4
 1 7 1 2 6 4 2 5 3 7 4 6 3 5
 1 6 1 7 2 4 5 2 6 3 4 7 5 3
 1 5 1 6 7 2 4 5 2 3 6 4 7 3
 1 4 1 5 6 7 4 2 3 5 2 6 3 7
 1 4 1 6 7 3 4 5 2 3 6 2 7 5
 1 6 1 3 5 7 4 3 6 2 5 4 2 7
 1 5 1 7 3 4 6 5 3 2 4 7 2 6
 1 5 1 6 3 7 4 5 3 2 6 4 2 7
 1 5 1 4 6 7 3 5 4 2 3 6 2 7
 5 1 7 1 6 2 5 4 2 3 7 6 4 3
 4 1 7 1 6 4 2 5 3 2 7 6 3 5
 4 1 6 1 7 4 3 5 2 6 3 2 7 5
 7 1 3 1 6 4 3 5 7 2 4 6 2 5
 7 1 4 1 6 3 5 4 7 3 2 6 5 2
 6 1 5 1 7 3 4 6 5 3 2 4 7 2
 4 6 1 7 1 4 5 2 6 3 2 7 5 3
 7 3 1 6 1 3 4 5 7 2 6 4 2 5
 4 6 1 7 1 4 3 5 6 2 3 7 2 5
 5 6 1 7 1 3 5 4 6 3 2 7 4 2
 7 4 1 5 1 6 4 3 7 5 2 3 6 2
 5 7 1 4 1 6 5 3 4 7 2 3 6 2
 3 6 7 1 3 1 4 5 6 2 7 4 2 5
 5 7 4 1 6 1 5 4 3 7 2 6 3 2
 2 6 7 2 1 5 1 4 6 3 7 5 4 3
 4 5 6 7 1 4 1 5 3 6 2 7 3 2
 2 3 7 2 6 3 5 1 4 1 7 6 5 4
 3 4 5 7 3 6 4 1 5 1 2 7 6 2
 2 3 6 2 7 3 4 5 1 6 1 4 7 5
 5 2 4 7 2 6 5 4 1 3 1 7 6 3
 2 6 3 2 7 4 3 5 6 1 4 1 7 5
 2 6 3 2 5 7 3 4 6 1 5 1 4 7
 2 4 7 2 3 6 4 5 3 1 7 1 6 5
 5 2 7 3 2 6 5 3 4 1 7 1 6 4
 5 2 4 6 2 7 5 4 3 1 6 1 3 7
 3 5 7 2 3 6 2 5 4 1 7 1 6 4
 2 7 4 2 3 5 6 4 3 7 1 5 1 6
 2 5 6 2 3 7 4 5 3 6 1 4 1 7
 5 2 6 4 2 7 5 3 4 6 1 3 1 7
 5 7 2 3 6 2 5 3 4 7 1 6 1 4
 5 3 6 7 2 3 5 2 4 6 1 7 1 4
 3 4 6 7 3 2 4 5 2 6 1 7 1 5
 7 2 6 3 2 4 5 3 7 6 4 1 5 1
 7 2 4 6 2 3 5 4 7 3 6 1 5 1
 6 2 7 4 2 3 5 6 4 3 7 1 5 1
 7 2 4 5 2 6 3 4 7 5 3 1 6 1
 5 7 2 6 3 2 5 4 3 7 6 1 4 1
 7 3 6 2 5 3 2 4 7 6 5 1 4 1
 3 7 4 6 3 2 5 4 2 7 6 1 5 1
 3 5 7 4 3 6 2 5 4 2 7 1 6 1
 5 3 6 4 7 3 5 2 4 6 2 1 7 1
 4 6 3 5 7 4 3 2 6 5 2 1 7 1

« Previous Next »

Backtracking

Print all permutations of a string

Print all combinations of balanced parentheses

Print all solutions in N-Queen Problem

Distinct permutations of the string

Warnsdorff’s algorithm for knight’s tour problem

Rat in a Maze

Find all solutions in a maze

Print all Hamiltonian path present in a graph

Print all intervals of given number

Find longest path in maze

Find longest increasing path in a matrix

Subset sum using backtracking

Find max number using k swap

Locate the center path of given maze by using footprint

Permutation with spaces

Tug of War

K partition with equal sum

Longest common subsequence

Print all longest common subsequence

Find all subsets using backtracking

Surrounded Regions

Generate n bit gray code

Find permutation of numbers divisible by k

Find maximum size subset with given sum

Split a number into smaller numbers

Find all subsequences with given sum and length

Find all perfect square root of n digit

Find all possible path with one magical key in maze

Print all permutations with repetition of characters

Print all initials sequences of given length

Print k size combinations in given array

Split a numeric string into fibonacci sequence

Print all N digit strictly increasing numbers

Print all possible strings of length N in a set

Knight Tour Problem

Generate all the binary strings of N bits

Print all binary strings without consecutive 1s

Generate all binary strings from given pattern

Print all palindrome permutations of a string

Possible ways to break a string using brackets

Print all interleavings of two strings

Longest possible route in a matrix with hurdles

Find all distinct combinations of k sum in array

Find paths from corner cell to middle cell in maze

Fill two instances of all numbers from 1 to n in a specific interval

Split a string into maximum number of unique substrings

Generate minimum number of coins that make a given value

Letter case permutation by using backtracking

Find all subsequences of string which divisible by k

Find possible group which contains one and two consecutive elements

Display Friends Pairing Group

Display all possible permutations of a number divisible by K

Power set in lexicographic order

Print all possible combinations of given size

Print all subsets with given sum

Print all possible combinations of given sum from 1 to n

Print distinct combinations of given sum without repeating number

Print all subsequences of given size

Print all sequences from 1 to n in given length k

Increasing subsequence of n natural number in k size

Print all non-increasing sequence of sum equal to a given number k

Print all combinations of N length sequences whose product is M

Distinct combinations of N length sequences whose product is M

Sequences of length K having each term divisible by its preceding term

Find all subsequences whose product is less than k in array

Find all subsequences of N length whose sum is even

Print all combinations of n natural number whose pair element difference is one

Find all even length binary sequences with same sum of first and second half bits

Print all subsequences of x whose sum is combination of even numbers

Generate palindromic binary strings of given length N

Generate all palindromic subsequence of n natural number

Generate all palindromic subsequence of length N and K Odd natural number

Generate all palindromic subsequence of length N and K Even natural number

Generate all palindromic subsequence of n natural number Whose adjacent elements are different type

Find Subset sum which divisible by k

Generate fixed bitonic sequence of n natural number

Generate all bitonic sequence of given range and size

Find all four elements that sum to a given value

Print all combinations factors of given number

Print combinations of characters of a numeric string which is less than x

Print all combinations of other digits on a '$' place of given sequence

All combinations of strings that can be used to dial a number

Travelling salesman problem using backtracking

Generate combinations of integer product whose adjacent numbers are not similar

Generate all unique partitions of a number

Generate all k digit number whose sum is to x

Generate all distinct combinations of N numbers whose sum is X

Generate combination of two equal length string which is belong to index

Generate all the products of a number in which each element is divisible by the previous element

Print all the sequences of length m that begin with n and the consecutive difference is less than k

Print the combinations of given vertices which connect of M edges they not contain cycle and its path cost is positive by node

Generate all passwords from given character set

Generate permutations with only adjacent swaps allowed

Generate all prime partition of a number

Split a number into prime numbers

Split a large Even number into small Even number

Split a large Odd number into small Odd number

Print all N digit jumping numbers

Print all n-digit numbers with sum of even and odd position digits whose absolute difference are one

Generate all possible permutations of words in a String

Generate all binary strings with 1 and 0 of size N

Print all distinct combinations of sum x and n natural number

Generate all n digit numbers whose consecutive even and odd digit

Generate all n digit numbers whose consecutive odd and even digit

Comment

Please share your knowledge to improve code and content standard. Also submit your doubts, and test case. We improve by your feedback. We will try to resolve your query as soon as possible.

New Comment

Name