a question in <<introduction to algorithms>>

User Name:

Password:

Remember me

The Shed is going Social! Join us on FaceBook and Twitter and chime in on the conversation.
		Dev Shed Forums > Programming Languages - More > Software Design
a question in <<introduction to algorithms>> Discuss a question in <<introduction to algorithms>> in the Software Design forum on Dev Shed. a question in <<introduction to algorithms>> Software design forum discussing design principles and non-language specific algorithms. Get help with logic, algebraic, or relational concepts.

Add This Thread To:

Del.icio.us

Digg

Google

Spurl

Blink

Furl

Simpy

Y! MyWeb

« Previous Thread | Next Thread »

Thread Tools

Search this Thread

Rate Thread

Display Modes

Dev Shed Forums Sponsor:

August 26th, 2002, 07:23 AM

fairstar

Junior Member

Join Date: Aug 2002

Posts: 1

Time spent in forums: < 1 sec
Reputation Power: 0

a question in <<introduction to algorithms>>

How to slove exercise 27.4-3
Show that any comparison network that can merge 1 item with n-1 sorted items to produce a sorted sequence of length n must have depth at least lg(n).

Viewing: Dev Shed Forums > Programming Languages - More > Software Design > a question in <<introduction to algorithms>>

« Previous Thread | Next Thread »

Developer Shed Advertisers and Affiliates

Thread Tools	Search this Thread
Email this Page	Search this Thread: Advanced Search
Display Modes	Rate This Thread
Linear Mode Switch to Hybrid Mode Switch to Threaded Mode	Rate This Thread:

Posting Rules
You may not post new threads You may not post replies You may not post attachments You may not edit your posts vB code is On Smilies are On [IMG] code is On HTML code is Off

View Your Warnings | New Posts | Latest News | Latest Threads | Shoutbox

Forum Jump