|
|||||||||
|
|||||||||
| |||||||||
|
|||||||||
|
|||||||||
| |||||||||
|
|
|
| |||||||||
 |
|
|
«
Previous Thread
|
Next Thread
»
|
Thread Tools | Search this Thread | Rate Thread | Display Modes |
Dev Shed Forums Sponsor:
|
|
|
|
#1
August 15th, 2004, 06:16 AM
|
|||
|
|||
how to find no of sets that can have max sum of n for a given array of odd numbers
An array of odd numbers and a given number 'n' is given, can u suggest me an algo that can find the number of sets that can have sum at maximum of the given number 'n'. (can it be done in O(n)).
reagrds Sato.
|
|
| Viewing: Dev Shed Forums > Programming Languages - More > Software Design > how to find no of sets that can have max sum of n for a given array of odd numbers |
| Thread Tools | Search this Thread |
| Display Modes | Rate This Thread |
|
|
 |
|
|
Del.icio.us
Digg
Google
Spurl
Blink
Furl
Simpy
Y! MyWeb
Linear Mode
