|
|||||||||
|
|||||||||
| |||||||||
|
|||||||||
|
|||||||||
| |||||||||
|
|
|
| |||||||||
 |
|
|
«
Previous Thread
|
Next Thread
»
|
Thread Tools | Search this Thread | Rate Thread | Display Modes |
Dev Shed Forums Sponsor:
|
|
|
|
#1
August 26th, 2002, 07:23 AM
|
|||
|
|||
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>> |
| Thread Tools | Search this Thread |
| Display Modes | Rate This Thread |
|
|
 |
|
|
Del.icio.us
Digg
Google
Spurl
Blink
Furl
Simpy
Y! MyWeb
Linear Mode
