Edit - Software Engineering Stack Exchange

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.

After thinking on this, this is close to my approach. I was wondering however if it would be more efficient to random sort the orphans instead of each list of A with common child count. Any thoughts?

maple_shaft
– maple_shaft ♦

2012-09-13 11:02:12 +00:00
Commented Sep 13, 2012 at 11:02
1

The main reason I suggest sorting the list of A's is so that the same ones dont always get the new B's first. So if on an average night you have enough new B's to fill half A's to 4, and the others to 3, its not the same A's each night getting filled to 4. I dont know if thats an issue or not (for ex, distributing sales leads, you dont want the same sales people to always get more leads). If its not, you can probably forgo the randomizing all together.

GrandmasterB
– GrandmasterB

2012-09-13 18:08:35 +00:00
Commented Sep 13, 2012 at 18:08

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 »