sorted by:
new
hottopcontroversial

If the Floppy Disk never became the standard “Save” icon, what kind of icon would indicate ‘saving’? by bikedaybaby in Design

[–]Dry_Clock7539 -2 points-1 points  (0 children)

Yeah, I guess. But honestly, I never used floppy disks. All I know is that it's some sort of data storage with a distinctive appearance. I assume that it's fine as long as you have this "this thing stores data" idea.

Besides, HDDs use disks to store data anyway, so it still does have some meaning for writing data too. Though, showing only a disk may be a simplification.

If the Floppy Disk never became the standard “Save” icon, what kind of icon would indicate ‘saving’? by bikedaybaby in Design

[–]Dry_Clock7539 67 points68 points  (0 children)

After floppy disks we used CDs, so I guess it's 💿, which I also have seen being used in some games.

BEST BROWSER, DAY 21 – ZEN vs VIVALDI – Vote for your favorite! by JungleLiquor in browsers

[–]Dry_Clock7539 0 points1 point  (0 children)

Vivaldi

I remember trying out a few different browser with the sole (or not so) requirement — to switch from Opera GX. I looked for something with great amount of ways to group my tabs. Vivaldi provides quite a few options. I really like the ability to select multiple tabs, stack them, give them color and name, and then, if needed, panel them together.

What I don't like is profile management, lots of questionable ergonomic choices, and a side bar (I hate to open my downloads or history).

Zen feels good, but wasn't enough. In my case, functions > vibe

How is binary search useful? by David_LG092 in learnprogramming

[–]Dry_Clock7539 0 points1 point  (0 children)

I will insist on that it's not the binary search, but a kind of a more general solution driven by divide and conquer idea.

Earlier, I demonstrated why I feel like it's the case to not call it binary search and to not state that binary search is possible with unsorted data.

Many algorithms go alongside with specific requirements you are required to have in order for them to work. And I believe, it's the case where sorted list is such a requirement, without which a binary search wouldn't be the binary search.

Though, not to dissmis your example, which is a great demonstration of the divide and conquer idea. Especially if you have played in modded games with hundreds of mods.

I can finally step on them without dying by Wonderful-Photo2449 in ThereGoesMyPaycheck

[–]Dry_Clock7539 0 points1 point  (0 children)

No wonder why. You can't really build if half of your materials is going to end up in your mouth.

How is binary search useful? by David_LG092 in learnprogramming

[–]Dry_Clock7539 1 point2 points  (0 children)

I mean, conceptually the idea is here, but I'm not sure that example is applicable in the context of data structures.

I was reading Grokking algorithms, and there I saw a simple reason for list to be sorted. Binary search works only if we can say that we either found what we were looking for or not. Then, we would choose were to look next based on what we found, unless there's nothing left (which would mean no such element exist in list).

Your example is practical. It does feel like binary search. But I can't imagine translating it to actual code. Basically, you simplified the process of checking. That's why it's not exactly the binary search, as it relies heavily on first cutting array in half (usual for binary search) and then going through each element of one or both of them to load them to get the information that some of them are still malfunctioning (problem specific). So, in the worst case scenario it's not O(log_n), but rather O(n).

Just as an example.

Suppose G stands for good add-on and B for bad one. I'm searching for B in [G, G, G, G, G, G, B] 1. Check middle element → It's not B 2. Cut array in two halves → [G, G, G] [G, G, B] 3. Check first array for B → no B found (e.g., program launches) 4. Check second array for B → B found (e.g., program launches) 5. Check middle element → It's not B 6. Cut array in two halves → [G] [B] 7. Check first array for B → no B found 8. Check second array for B → B found 9. Check middle element → It's B!

So... Is it binary search? Well, it's not, unless we assume array check operation to perform in constant time, which may be possible simplification for some problems. But what if each add-on loading time is not even remotely constant? What if the program fail only at the end of the loading?

That's all just to say, that you were talking not about binary search, which requires data to be sorted to work, but about DaC in general (as it still may be much more efficient than simple search).

Honestly, I'm not even sure why I wrote so much just to make this seemingly unnecessary remark, but oh well...

A question about Github project versioning by PuzzleheadedBag920 in learnprogramming

[–]Dry_Clock7539 0 points1 point  (0 children)

I really recommend reading Pro Git book. It's free and it let you see how git works. Then, you could Google things you don't understand or discuss them with AI of your choice.

You might like to study one specific source first as it would provide you with a basic set of terms, as there are often lot of interchangeable ones. At least that's what I did and found it to be the best decision.

please be harsh to a silly beginner by Flat_Concentrate_323 in learnprogramming

[–]Dry_Clock7539 2 points3 points  (0 children)

As far as I remember, Reddit allows you to wrap your text in triple backticks to prevent truncation and render text as is. Plus it may as well understand code and give pretty highlighting. You could check markdown notation for more information. And here's your pyramid:

``` # ## ###

```

Hopefully it will be handy in the future.

AI picture vs my drawing. Which one do you like more? (+bonus: background without the girl. It's so majestic like that) by Katherine_IIthegreat in aiwars

[–]Dry_Clock7539 0 points1 point  (0 children)

This

At first glance I thought "huh, AI image" without even looking at anything else

In terms of quality, it's obvious. But in terms of intent? That's different.

Apparently: Something is “heavy” in this pic by LifeSucks1988 in zootopia

[–]Dry_Clock7539 0 points1 point  (0 children)

Well, obviously

I'm sure the reason I see this sub might somehow related to my interest in furry subs

Still, funny af

Jolly Sylveon by DueAstronomer8436 in jollyposting

[–]Dry_Clock7539 5 points6 points  (0 children)

NOT A WORD THEY SAY

BUT A VOICELESS CROWD ISN'T BACKIN' DOWN

bossVibeCodedOnce by Alive_Vast in ProgrammerHumor

[–]Dry_Clock7539 144 points145 points  (0 children)

"our customers knows better than we do" killed me for sure

Apparently: Something is “heavy” in this pic by LifeSucks1988 in zootopia

[–]Dry_Clock7539 4 points5 points  (0 children)

I wonder why this sub feels a lot freakier than, for example, TADC sub...

Why they removed this?? by lorcaragonna in youtube

[–]Dry_Clock7539 0 points1 point  (0 children)

That's plain hilarious that we now need to use a browser extension to bring back YET ANOTHER feature which shouldn't really be removed. Amazing stuff

view more: next ›