I wrote one in C this week.
And I used recursivity at some point.
For now, since functions aren't yet implemented, you probably can't do recursive algorithms.
The cool thing with recursivity, is that you get some kind of tree of resolution for free.
Without recursivity, you need to save in some way each iteration you are making so if you end up with an impossible solution, you can backtrack and try other values.
Some month ago, I implemented a backtracking algorithm to create a maze, so I think it's possible in C2... but yeah just slightly harder and uglier.