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 reverse_doubly_linked_list(struct node* head)
ReplyDelete{
struct node* ptr1=head;
if(head->next==NULL) return;
while(ptr1!=NULL)
{
struct node* agla=ptr1->next;
struct node* temp=ptr1->next;
ptr1->next=ptr1->previous;
ptr1->previous=temp;
ptr1=agla;
}
}
@ankit what is the use of using two different pointers agla and temp....can't it be done by temp only...
ReplyDelete@priyaranjan go it :)
ReplyDelete