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.
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.
void print(int x,int y)
ReplyDelete{
int i =x;
LABEL:
printf("%d\n",i++);
if(i>y)
return;
else
goto LABEL;
}
#include
ReplyDeleteusing namespace std;
void print_100(int n)
{
if(n<0)
return;
print_100(n-1);
cout<<n;
}
int main()
{
print_100(100);
return 0;
}
@ankit yes it will work fine..:)
ReplyDelete