PowerSet Function

[alex067]

I have a program which has to find the longest non-decreasing order sub sequence in a given array using a powerSet algorithm

The algorithm compiles fine, but the output always says 0.. which is obviously false because there has got to be at least 1 subsequence where there is a non decreasing order

ex: the given array input is 0,5,2,4,3,10,7
the output:
supposed to show the longest non-dec order, but instead it keeps showing 0

The size being passed is: 9
the array of elements being passed is an array with random elements ranging from 1- 100

void PowerSet(int size, int *elements)
{
	int bestSize;
	int *R;
	int *bestSet;
	R = new int[size];
	bestSet = new int[size + 1];
	bestSize = 0;
	printPSet(size, bestSet, bestSize, elements);
	for (int i = 0; i < bestSize; i++)
	{
		R[i] = elements[bestSet[i + 1] - 1];
	}
	cout << "The longest non-decreasing subsequence has length: " << bestSize << endl;
	cout << "The longest non-decreasing subsequence is: ";
	printSeq(bestSize, R);
	delete[] elements;
	delete[] R;

}
void printSeq(int size, int *seq)
{
	for (int i = 0; i < size; i++)
	{
		cout << seq[i] << " ";
	}
	cout << endl;
}

void printPSet(int size, int *&best, int &bestSize, int *ele)
{
	int *stack; 
	int k = 0;
	stack = new int[size + 1];
	stack[0] = 0; //initialize first element since not considered as part of set
	while (1)
	{
		if (stack[k] < size)
		{
			stack[k + 1] = stack[k] + 1;
			k++;
		}
		else
		{
			stack[k - 1]++;
			k--;
		}
		if (k == 0)
		{
			break;
		}
	}
	checkSet(stack, k, best, bestSize, ele);
	delete[] stack;
}
void checkSet(int *stack, int k, int *&best, int &bestSize, int *ele)
{
	if (k < 2) //check if indices instack generate subsequence of non-dec
	{
		//this means the set contains isngle index, so it is in non-dec
		if (k > bestSize) //means we found better set 
		{
			//store stack into best set, update bestsize to k
			for (int i = 0; i < k; i++)
			{
				best[i] = stack[i];
			}
			bestSize = k;
			return;
	
		}
	}	
	else //means set contains more than single index
	{
		for (int i = 0; i < k - 1; i++)
		{
			if (ele[stack[i + 1] - 1] <= ele[stack[i + 2] - 1])
			{
				//do nothing
			}
			else
			{
				return;
			}
		}

	}
	//we have non-dec so we check it against best set
	if (k > bestSize)
	{
		//we found a better set
		//store stack into best set, update bestsize to k
		for (int i = 0; i < k; i++)
		{
			best[i] = stack[i];
		}
		bestSize = k;
		return;
	}
	else
	{
		return;
	}

}