You are given n real numbers in an array. A number in the array is called a decimal dominant if it occurs more than n/10 times in the array. Give an O(n) time algorithm to determine if the given array has a decimal dominant.
Given an integer n, write a function that returns count of trailing zeroes in n!. Examples:
Input: n = 5
Output: 1
Factorial of 5 is 20 which has one trailing 0.
Input: n = 20
Output: 4
Factorial of 20 is 2432902008176640000 which has
4 trailing zeroes.
Input: n = 100
Output: 24
void permutate( char[] str, int index )
ReplyDelete{
int i = 0;
if( index == strlen(str) )
{ printf(str);
return;
}
for( i = index; i < strlen(str); i++ )
{
swap( str[index], str[i] );
permutate( str, index + 1 );
swap( str[index], str[i] );
}
}
call initially permutate( "abcdefgh", 0 );