@praveen raj: yes bubble sort takes O(N) in best case, but selection sort it depends the selection algo(does the selection starts from the first(then itsO(n)) or last(then its O(N^2)) Thank you, Sid.
On Fri, Sep 9, 2011 at 11:20 AM, praveen raj <praveen0...@gmail.com> wrote: > for checking whther given array sorted or not... bubble sort or insertion > sort... takes O(n).. time... > > With regards, > > Praveen Raj > DCE-IT 3rd yr > 9999735993 > praveen0...@gmail.com > > > > On Thu, Sep 8, 2011 at 11:32 PM, aayush jain <ajain...@gmail.com> wrote: >> >> thanx @piyush.... >> >> -- >> 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.
