Code:
#include iostream
#include math.h
using namespace std;
// A function to print array element according to the code in the argument list.
void print(char code[], int arr[], int n)
{
int i;
cout<<"\t{ ";
for(i = 0; i < n; i++)
{
// Print if the corresponding value is '1'.
if(code[i] == '1')
cout<
}
cout<<"}\n";
}
// A function to generate subset by binary counting.
int BinaryCounting(int arr[], int n)
{
int r, i, l;
char binary[] = "0000";
r = pow(2, n);
for(i = 0; i < r; i++)
{
print(binary, arr, n);
l=n-1;
// Incrementing the binary value with each iteration.
h:
if(binary[l] == '0')
binary[l] = '1';
else
{
binary[l] = '0';
l--;
goto h;
}
}
}
int main()
{
int i, n;
cout<<"\nEnter the number of element array have: ";
cin>>n;
int arr[n];
cout<<"\n";
// Take the input of the array.
for(i = 0; i < n; i++)
{
cout<<"Enter "<
cin>>arr[i];
}
// Print the subset using binary counting method.
cout<<"\nThe subset in the binary counting method: \n";
BinaryCounting(arr, n);
return 0;
}
Output:
Case 1:
Enter the number of element array have: 4
Enter 1 element: 1
Enter 2 element: 2
Enter 3 element: 3
Enter 4 element: 4
The subset in the gray code order:
{ }
{ 4 }
{ 3 4 }
{ 3 }
{ 2 3 }
{ 2 3 4 }
{ 2 4 }
{ 2 }
{ 1 2 }
{ 1 2 4 }
{ 1 2 3 4 }
{ 1 2 3 }
{ 1 3 }
{ 1 3 4 }
{ 1 4 }
{ 1 }
Case 2:
Enter the number of element array have: 5
Enter 1 element: 5
Enter 2 element: 4
Enter 3 element: 3
Enter 4 element: 2
Enter 5 element: 1
The subset in the gray code order:
{ }
{ 1 }
{ 2 1 }
{ 2 }
{ 3 2 }
{ 3 2 1 }
{ 3 1 }
{ 3 }
{ 4 3 }
{ 4 3 1 }
{ 4 3 2 1 }
{ 4 3 2 }
{ 4 2 }
{ 4 2 1 }
{ 4 1 }
{ 4 }
{ 5 4 }
{ 5 4 1 }
{ 5 4 2 1 }
{ 5 4 2 }
{ 5 4 3 2 }
{ 5 4 3 2 1 }
{ 5 4 3 1 }
{ 5 4 3 }
{ 5 3 }
{ 5 3 1 }
{ 5 3 2 1 }
{ 5 3 2 }
{ 5 2 }
{ 5 2 1 }
{ 5 1 }
{ 5 }
More C++ Programs:
