10^9->-10^9 -> 8-> 7- > NULL . It wont help in this case.......
On Sat, Jul 23, 2011 at 9:55 AM, keyan karthi <[email protected]>wrote: > counting sort ll help to some extent... find the min and max element O(n) > now u just need an array of size "max-min" to store the values.... then > just traverse the list and while updating u do value+min... still it is not > suitable if the magnitude is high..... > > > On Sat, Jul 23, 2011 at 9:45 AM, Ankur Khurana > <[email protected]>wrote: > >> n logn merge sort.................count sort only when range is known..... >> >> >> On Sat, Jul 23, 2011 at 1:35 AM, sunny agrawal >> <[email protected]>wrote: >> >>> Cannot be done in O(N) if elements of list can take any value because >>> then counting sort wont help >>> >>> On Sat, Jul 23, 2011 at 1:24 AM, Pankaj <[email protected]>wrote: >>> >>>> For linklist? How >>>> >>>> >>>> On Sat, Jul 23, 2011 at 1:23 AM, Kamakshii Aggarwal < >>>> [email protected]> wrote: >>>> >>>>> use counting sort.. >>>>> >>>>> >>>>> On Sat, Jul 23, 2011 at 1:22 AM, rShetty <[email protected]> wrote: >>>>> >>>>>> How to sort Linked lists in O(n) time ?? >>>>>> Give the algorithm or the explanation or clue to tackle the problem >>>>>> >>>>>> -- >>>>>> 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. >>>>>> >>>>>> >>>>> >>>>> >>>>> -- >>>>> Regards, >>>>> Kamakshi >>>>> [email protected] >>>>> >>>>> -- >>>>> 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. >>>>> >>>> >>>> -- >>>> 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. >>>> >>> >>> >>> >>> -- >>> Sunny Aggrawal >>> B-Tech IV year,CSI >>> Indian Institute Of Technology,Roorkee >>> >>> -- >>> 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. >>> >> >> >> >> -- >> Ankur Khurana >> Computer Science >> Netaji Subhas Institute Of Technology >> Delhi. >> >> -- >> 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. >> > > -- > 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. > -- Ankur Khurana Computer Science Netaji Subhas Institute Of Technology Delhi. -- 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.
