Recursive algorithms

Write a recursice algorithm to find x^n mod m whenever n,x and m are positive integers based on the fact that :

x^n mod m = (x^(x-1) mod m * x mod m)mod m