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.
struct node* reverse(struct node *head)
ReplyDelete{
struct node *rest = head->next;
if(rest == NULL)
return head;
rest = reverse(head->next);
head->next->next = head;
head->next = NULL;
return rest;
}