Factorial Trailing Zeroes

Given an integer n, return the number of trailing zeroes in n!.

Note: Your solution should be in logarithmic time complexity.

class Solution {
public:
    int trailingZeroes(int n) {
        if (n <= 0)
	    {
		    return 0;
	    }

	    int result = 0;
	    while (n > 0)
	    {
		    int temp = n/5;
		    result += temp;
		    n = temp;
	    }

	    return result;
    }
};