Big O notation algorithms — OZONE Asylum, home of the Mad Scientists

This page's ID: 28677

Edit Post

Who can edit a post?	The poster and administrators may edit a post. The poster can only edit it for a short while after the initial post.

Your User Name:
Your Password:
Login Options:	Remember Me On This Computer

Your Text: Insert Slimies » Insert UBB Code » Close Last Tag \| All Tags UBB Help	Hi All, Pls some help over here....:eek: 1)Suppose algorithm A requires nlog2n to sort n items and B requires (n^2)/4 to sort the n items for which n is algorithm B superior to algorithm A 2) Show that n>=4(n/4)log(n/2) = (n/4)log n Thanks ~Sig coming soon~ Loading...
Options:	Enable Slimies Enable Linkwords

Edit Post