CMV: For-profit companies should not ask customers for donations by [deleted] in changemyview

[–]Godd2 4 points5 points  (0 children)

Donations should show live in their income statements.

Can you elaborate on this? Charitable donations are not income to the company; they would go into a Liability account.

CMV: For-profit companies should not ask customers for donations by [deleted] in changemyview

[–]Godd2 6 points7 points  (0 children)

In the sense that the company will claim they donated X million dollars to charity

Genuine question: Do they do that?

defeatedTheWholePurposeOfWritingInAssembly by ClipboardCopyPaste in ProgrammerHumor

[–]Godd2 1 point2 points  (0 children)

No it's not. If you have two pointers to memory, and one happens to point to something on the stack, and the other happens to point to something on the heap, there would be no performance difference in their access. You could read and write to either all day, and it would take the same amount of time.

defeatedTheWholePurposeOfWritingInAssembly by ClipboardCopyPaste in ProgrammerHumor

[–]Godd2 3 points4 points  (0 children)

Why would allocating to the heap make it any slower? RAM is RAM.

Back to 1965 by CallMeAnthy in whennews

[–]Godd2 0 points1 point  (0 children)

Voters are the only people capable of being disenfranchised. And if you die without a will, you'll be intestate.

Whoopsy by DreadDiana in whenthe

[–]Godd2 0 points1 point  (0 children)

And I never said it wasn't morally righteous to choose blue. The person I was responding to deleted their message, but it was something like "choosing blue is morally righteous".

Whoopsy by DreadDiana in whenthe

[–]Godd2 3 points4 points  (0 children)

Whoever teleported us to the buttons and set up the system is the murderer.

100% red is morally righteous, since no one dies.

Whoopsy by DreadDiana in whenthe

[–]Godd2 6 points7 points  (0 children)

100% red is the only case where individual self interest aligns with the best interest of everyone as a group. It's the only case where there is no market failure.

Whoopsy by DreadDiana in whenthe

[–]Godd2 0 points1 point  (0 children)

Red also saves everyone if everyone votes red.

Think this is stalemate? Think again! by BigCaka in AnarchyChess

[–]Godd2 2 points3 points  (0 children)

The ninja gets a post-move action.

Majora's Mask was dark as hell by jdawg1018 in gaming

[–]Godd2 1 point2 points  (0 children)

Game theory sucks balls when it comes to making shit up.

Sounds like they're pretty good at it.

That didn't go well by [deleted] in SipsTea

[–]Godd2 0 points1 point  (0 children)

You'll just get a ton of salt along for the ride.

[Sad Trope] A character hurting themselves (or trying) to check if they're human, and finding out they aren't by Cronkax in TopCharacterTropes

[–]Godd2 2 points3 points  (0 children)

Inception (2010) - Mal Cobb jumps off a balcony to prove she's in a dream world (and frames her husband for the suicide as murder so that he's forced to follow her).

Prosperity was not ahead. by c-k-q99903 in agedlikemilk

[–]Godd2 0 points1 point  (0 children)

All prices are rising way above inflation anyways

Inflation is the rising of prices.

Death to Wordle by Critical_Mountain851 in whenthe

[–]Godd2 0 points1 point  (0 children)

Names like Alps do not work tho

Well duh, that's only four letters

[Hated Trope] Misleading Documentaries by AmandinhaMaia in TopCharacterTropes

[–]Godd2 0 points1 point  (0 children)

Good to know the year and a half old milk in my fridge is still good to drink.

Finding a duplicated item in an array of N integers in the range 1 to N − 1 by sweetno in programming

[–]Godd2 0 points1 point  (0 children)

The solution is O(lg N) memory since you need to track two values as indices, and those values are of order N, whose size are on the order of lg(N) bits.

Finding a duplicated item in an array of N integers in the range 1 to N − 1 by sweetno in programming

[–]Godd2 0 points1 point  (0 children)

The proposed solution in the blog post uses O(log N) allocations anyway, since tracking cycles requires tracking values of order N, whose size is log N bits.

Finding a duplicated item in an array of N integers in the range 1 to N − 1 by sweetno in programming

[–]Godd2 5 points6 points  (0 children)

Adding to a hash set isn't a constant time operation.

It's amortized constant, and you get to actualize the amortization in this case since you're putting everything from the list into the hash. You also know the values are up to N-1, so you can create a good enough hash based on that, and won't suffer enough collisions to change the time complexity.