Implement a function getbits, that returns the(right adjusted) n bits that begin at position p of an integer. Assume bit position 0 is at the right end and that n and p are sensible positive values.
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.
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 );