Timeline for Finding three elements in an array whose sum is closest to a given number
Current License: CC BY-SA 2.5
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 24, 2014 at 17:40 | comment | added | Ext3h | With this approach, complexity for k elements is O(n^(k-1)) for k >= 2. You need to add an outer loop for every additional summand. | |
| Feb 18, 2012 at 6:30 | comment | added | coder_15 | if you want to find k elements to get the sum what is the complexity? How you deal with this? | |
| Jan 15, 2010 at 9:36 | history | edited | codaddict | CC BY-SA 2.5 | added 17 characters in body |
| Jan 15, 2010 at 9:26 | history | answered | codaddict | CC BY-SA 2.5 |