Edit - Stack Overflow

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

Rev

4

Also, after sorting, discard all the numbers which are bigger than sum. I assume that you have all positive integers.

Jack
– Jack

2010-04-19 11:03:16 +00:00
Commented Apr 19, 2010 at 11:03
yeah that's what i though and then i got all busy trying to compute the complexity it never occured to me that both the operations are o(nlogn)

Bunny Rabbit
– Bunny Rabbit

2010-04-19 11:34:17 +00:00
Commented Apr 19, 2010 at 11:34
1

You don't have to search for every elements actually. Since you've sorted the array, stop searching at sum/2 (doesn't impact the big O, but still :p)

Matthieu M.
– Matthieu M.

2010-04-19 13:27:52 +00:00
Commented Apr 19, 2010 at 13:27
Discarding those bigger numbers wouldn't that break the algorithm if there's negative numbers?.

Fabman
– Fabman

2024-09-15 11:18:28 +00:00
Commented Sep 15, 2024 at 11:18

Add a comment |

Correct minor typos or mistakes
Clarify meaning without changing it
Add related resources or links
Always respect the author’s intent
Don’t use edits to reply to the author

create code fences with backticks ` or tildes ~
```
like so
```
add language identifier to highlight code
```python
def function(foo):
print(foo)
```
put returns between paragraphs
for linebreak add 2 spaces at end
_italic_ or **bold**
indent code by 4 spaces
backtick escapes `like _so_`
quote by placing > at start of line
to make links (use https whenever possible)

<https://example.com>

[example](https://example.com)

<a href="https://example.com">example</a>

formatting help »
answering help »

Collectives™ on Stack Overflow