Catch up on stories from the past week (and beyond) at the Slashdot story archive

typodupeerror
DEAL: For \$25 - Add A Second Phone Number To Your Smartphone for life! Use promo code SLASHDOT25. Also, Slashdot's Facebook page has a chat bot now. Message it for stories and more. Check out the new SourceForge HTML5 Internet speed test! ×

## Comment Re:Well that makes sense (Score 1)181

[...] where you can't get anything done because there's a meeting soon. [...]

WTF.
What kind of undisciplined clowns are you employing there?

It's no different at all than lunchtime coming up. You work until it's time to take a break. A meeting is a break from work. Are you not able to get anything done in the three hours before lunch?

## Comment Re: Virtual Private Raid (Score 3)151

But the chance of losing your data is triple.

I was about to say, "That's not how probability works!" but it turns out that you are actually correct.

If each site has a 1% chance of being seized, then it means each site has a 99% chance of not being seized. Multiplying these probabilities together gives .99^3 = .970299 or about a 97.03% chance that no site will be seized — which means that you've got about a 3% chance of having one or more site seized.

The key here is that 1 – (1 – x)^3 is very close to 3x for small x.

## Comment Re:Interesting story (Score 2, Insightful)553

Nope. FAIL!

Your implementation only works for trees where all leaf nodes are at the same depth.

A binary tree is still balanced if one branch is depth n depth and the other branch is depth n+1.

So you have to compare like this:

(abs(depthLeft - depthRight) <= 1)) {

## Comment Re: Doing it wrong? (Score 1)600

*Every* embedded software design standard expressly forbids recursion

My embedded software design standard doesn't.

Thank you. GP is a fucking moron. As you go on to point out, many algorithms have natural limits on the recursion depth. A recursive mergesort, for example, can never go deeper than ceil(log2(n)) calls, where n is the number of elements to sort. If you have room on your stack for 30 calls deep, you can sort a list of a billion items. People who say recursion has no place in embedded software design either haven't thought their arguments through very carefully, or are very inexperienced programmers, or are just plain dumb.

# Slashdot Top Deals

The reason computer chips are so small is computers don't eat much.

Working...