Home/ Questions/Q 8531421
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-06-11T09:28:48+00:00

I’m looking for a hint to an algorithm or pseudo code which helps me

  • 0

I’m looking for a hint to an algorithm or pseudo code which helps me calculate sequences.
It’s kind of permutations, but not exactly as it’s not fixed length.
The output sequence should look something like this:

A
B
C
D
AA
BA
CA
DA
AB
BB
CB
DB
AC
BC
CC
DC
AD
BD
CD
DD
AAA
BAA
CAA
DAA
...

Every character above represents actually an integer, which gets incremented from a minimum to a maximum.
I do not know the depth when I start, so just using multiple nested for loops won’t work.

It’s late here in Germany and I just can’t wrap my head around this. Pretty sure that it can be done with for loops and recursion, but I have currently no clue on how to get started.

Any ideas?

EDIT: B-typo corrected.

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    Based on the comments from the OP, here’s a way to do the sequence without storing the list.

    Use an odometer analogy. This only requires keeping track of indices. Each time the first member of the sequence cycles around, increment the one to the right. If this is the first time that that member of the sequence has cycled around, then add a member to the sequence.

    The increments will need to be cascaded. This is the equivalent of going from 99,999 to 100,000 miles (the comma is the thousands marker).

    If you have a thousand integers that you need to cycle through, then pretend you’re looking at an odometer in base 1000 rather than base 10 as above.

    • 0