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.
int *arr;
ReplyDeleteint getNextPrime(int index)
{
int i;
int check=0;
bool flag = false;
for(i=arr[index-1]+2;;i=i+2)
{
flag = false;
check =0;
while(check < index && arr[check]<=sqrt(i))
{
if(i%arr[check] == 0)
{
flag = true;
break;
}
check++;
}
if(!flag)
{
return i;
}
}
}
int main()
{
int n,i=2;
int k=3;
cout<<"Enter the value of n"<>n;
arr = (int*)malloc(sizeof(int)*n);
arr[0]=2;arr[1] = 3;
while(i<n)
{
arr[i] = getNextPrime(i);
i++;
}
cout<<arr[n]<<"\n";
return 0;
}