@above... we have to sort the DLL ..so navies solution prduce the O(n^2) solution using merger sort we can do it in (nlogn)...but using merger we can also sortv the doubly linked list in (nlogn) then what is benefit of having perv pointer in DLL ..so according to me we can do it in O(n) because DLL has two pointers that gives use benefit..i have n^2 solution..but need something less then it..so now try to solve the problem.....hope u got..it..
Thanks Shashank ""The best way to escape from a problem is to solve it."" -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
