We are given the algorithm, yet i'm still kinda lost on it.

recursive_funtion(position) { for number from 1 to 9, not used elsewhere already { put this number on this position, make it unavailable if solution valid { if solution complete { done, show solution }else{ recursive_function(next_position) } } (make this space blank again, and the number available) } }

I have a hard time understanding from text for some reason, but if I am given code examples to look at I can easily understand whats going on and pick up on it that way.

Any help is appreciated. Thanks.