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


Forgot your password?

Comment Re:Ouch! (Score 1) 5

It's amazing that I still remember my Slashdot password (after not using it for *years*), but when I see my comment attributed to "anonymous coward", I wonder why I bothered.

Get well!


Comment Re:My favorite bug (Score 1) 861

Hash table operations are probabilisticly O(1), degrading to O(N) in the worst case (many hash collisions).

Unmodified quick sort has expected complexity O(N log N), but worst case O(N**2), so if you pick your data carefully, you can get either solution to be O(N**2).

"The Mets were great in 'sixty eight, The Cards were fine in 'sixty nine, But the Cubs will be heavenly in nineteen and seventy." -- Ernie Banks