plz refer sahani's book of algo..:) On 7/2/11, Dave <dave_and_da...@juno.com> wrote: > @Udit: This can't be correct. For n = 3, it predicts 4-1/2 > comparisons. I don't know what half of a comparison is. Three > comparisons are all that is required. In fact, for all odd n, it > predicts a non-integer number of comparisons. > > Dave > > On Jul 2, 3:51 pm, udit sharma <sharmaudit...@gmail.com> wrote: >> If n is odd, then we perform >> 3*n/2 comparisons. If n is even, we perform 1 + 3*(n-2)/2 >> >> -- >> Regards >> UDIT >> DU- MCA > > -- > 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. > >
-- Thanks and Regards, ------------------------------ **DIPANKAR DUTTA M-TECH,Computer Science & Engg. E&C Dept,IIT ROORKEE Uttarakhand , India – 247667 ------------------------------------------- website:http://people.iitr.ernet.in/shp/09535009/Website/index.html ph no-09045809987 Lab: 286454 email:dipan...@iitr.ernet.in -- 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.
