@Dave :but it will take more time. any other solution wrote:
> @Naresh: The sequence of numbers generated by this rule for any given
> starting number is called a Collatz Sequence. Try googling it.
>
> Here is a list of the number of iterations required for n between 1
> and 10,000: http://oeis.o
@Rahul
the only one pointer is there and it is pointing to the 4th node only,, and
we don't know where the head is points to...
On Wed, Oct 6, 2010 at 11:20 PM, RAHUL KUJUR wrote:
> Take two pointers p and q. Initially p points to head.
>
>
> while(p!="given pointer")
> {
> p=p->link;
> q
In a linked list how to insert an element at 3rd position given a pointer to
4th position.
--
Shoban babu.B
M.E.,CSA,
IISc.
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algoge...@googlegroups.com.
To
