Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Favorites infavorites:mine
infavorites:1234
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with Search options answers only user 489

Merge sort is an O(n log n) comparison-based sorting algorithm.

5
votes
I would say this is a solid, workmanlike implementation of a merge sort. I can see some areas for improvement though. As far as style goes, the most obvious improvement would be to use variable name …
answered Apr 11 '14 by Jerry Coffin
45
votes
Avoid std::endl At least at first glance, it looks like you've committed the single largest sin in C++ with respect to file I/O speed: you've used std::endl where all you really wanted was a new-line …
answered Jun 21 '17 by Jerry Coffin
3
votes
After fixing the problem @RichHendricks pointed out this still has...not a problem exactly, but still a design that's less than optimal (at least in my opinion). In the initial phase, you basically d …
answered Mar 10 '14 by Jerry Coffin
8
votes
Note: I'm at least trying to avoid repeating @Edward's points, which I think are all quite good. It looks like while I was writing this @Loki wrote a few things that are a lot closer to what I said--s …
answered Jun 8 '16 by Jerry Coffin
2
votes
My immediate reaction would be to accept a collection of ranges of some sort (e.g., Boost Range, or even just a pair of iterators). Since the range (or iterator) types would be template parameters, t …
answered Apr 6 '14 by Jerry Coffin