Hi,

I was hoping that someone could give me some direction with how to solve this probem.

The only info in this problem is

word has N digits[only digits] and the numbers (output) should be in increasing order example 1469 or 468

The output should give all combinations in the increasing order

Example :

Enter length of number : 3

This output should give all numbers without recursion in increasing order for numbers between [0-9].

Thanks,

Cathy