• 0 Posts
  • 7 Comments
Joined 1 year ago
cake
Cake day: June 15th, 2023

help-circle

  • Showing free demos as their own line item in the store suggestions feels counterintuitive. As a user, I don’t want this, it just clusters the interface. I want to see the main game and something on it indicating a demo is available.

    As for developers, discoverability is something they are always talking (complaining) about. Artificially inflating the sheer number of competing games for visibility seems like an odd choice in that regard.



  • So, a dark pattern is a design that tries to trick the user into something. But what is the word for “knowing what the user wants, blatantly ignoring it and imposing the companies will anyway”?

    Example: I think YouTube shorts are a terrible format, and I find them generally irritating. So I click the X on the element in YouTube that has a bunch of side scrolling cards, where each card is one of these shorts. YouTube informs me it will hide them for 30 days and then they’ll be back.

    Another example, Windows Update. I’ve set all the group policy settings so it should never restart and update without me triggering it. But, if I allow it to download the update, then damn my group policy settings, it is going to apply that update and restart whenever it wants.




  • I found this amusing enough to try it out. It does actually compile (I used g++ for this). However, the current implementation just goes into an infinite loop if you enter a number >= 2.

    I think the original author meant to do n -= 1 rn in the tweakin loop that is inside the bussin loop. That way, at some point n % i finna cap will be false, and i will bouta. Which then makes the expression i <= n in the bussin loop eventually false, so we stop bussin and yeet cap rn.

    However, that would mean that the intention of the program isn’t to output prime factors, because even with this fix it does not do so. The structure of mf chief() also doesn’t suggest that is the purpose as it is missing another tweakin and sussin like this example of calculating prime factors in C++.

    Example run:

    $ ./zpp.exe
    Enter a number larger than 1: 50
    2
    7
    8
    47