can anyone explain vividly how we can use merge sort here. thank you. On Sat, Mar 24, 2012 at 1:54 PM, Sambhavna Singh <coolsambha...@gmail.com>wrote:
> @atul: we always need to point at the next larger node..so that is ruled > out. > > On Sat, Mar 24, 2012 at 10:14 AM, Atul Singh <atulsingh7...@gmail.com>wrote: > >> I couldn't understand the meaning of " *return the pointer to smallest*" >> Is it that that the pointer of largest node will point to smallest node. >> >> >> >> ATul Singh | Final Year | Computer Science & Engineering | NIT >> Jalandhar | 9530739855 | >> >> -- >> 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. >> > > -- 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.
