O(n log(n)) can we do better ? On Sat, Sep 10, 2011 at 10:02 PM, sukran dhawan <sukrandha...@gmail.com>wrote:
> after finding gcd of first two elements use gcd as first no and next array > element as second no annd call gcd function > repeat the proc till array exhausts > > On Sat, Sep 10, 2011 at 9:39 PM, Neha Singh <neha.ndelhi.1...@gmail.com>wrote: > >> @sukran : we hv to find gcd of all the elements of the array, not of 2 >> elements. >> Give detailed algo >> >> -- peat >> >> 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. > -- 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.
