Ignore my previous post for find the 3/4th...its actually traversing the list thrice....so it better you traverse the list once and find the number of nodes in it...then then traverse 3/4th times the number of nodes...
But the algo given by me is efficient if we are required to compute 1/nth of a node... -- *Piyush Sinha* *IIIT, Allahabad* *+91-7483122727* * <https://www.facebook.com/profile.php?id=100000655377926> "NEVER SAY NEVER" * -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.