fargeol

joined 1 year ago
sorted by: new top controversial old
I am font hunting again in c/microblogmemes@lemmy.world
[–] fargeol@lemmy.world 68 points 2 days ago (2 children)

In France, we have "Portez ce vieux whisky au juge blond qui fume" ("Bring that old whiskey to the blond smoking judge") and I find it really... french since we manage to put alcohol and tobacco in an alexandrine just to make a pangram.

What would be the "least boring" sorting algorithm? in c/data_structures@programming.dev
[–] fargeol@lemmy.world 1 points 3 days ago

That sounds really promising since the user input doesn't need to be "A vs B" but can can accept nuances (with a cursor of some sort).
I'll look further into it

What would be the "least boring" sorting algorithm? in c/data_structures@programming.dev
[–] fargeol@lemmy.world 2 points 3 days ago

the problems are: my elements are not comparable without a user input (I added an example with fruits in an edit in my post), and even if I chose a good pivot, most of the first questions would be "Do you prefer Coconut or Apple? Do you prefer Coconut or Banana? Do you prefer Coconut or Durian?" (supposing Coconut is the pivot) which would be a bit boring

What would be the "least boring" sorting algorithm? in c/data_structures@programming.dev
[–] fargeol@lemmy.world 3 points 3 days ago (1 children)

Merge sort is really promising since I can first break my list into pairs, sort every pair (if my list is randomized, those pairs are random, which is good for entertainment) and then alternate between the different merges so we don't focus on one half of the list

What would be the "least boring" sorting algorithm? in c/data_structures@programming.dev
[–] fargeol@lemmy.world 1 points 3 days ago

I already managed to break the code for my sorting algorithm to take an async lambda as a comparison function. Therefor I can choose my sorting algorithm on the fly.

As for magic, I thought the interface would show you pairs of elements that look randomly picked and after a while it gives you your sorted list. So, the "magical" thing would be that not-so-random selection of pairs

What would be the "least boring" sorting algorithm? in c/data_structures@programming.dev
[–] fargeol@lemmy.world 2 points 3 days ago (2 children)

QuickSort sounds good since it's, well... quick, but the whole pivot thing would compare the pivot to everything as a first step which would not be very entertaining if done manually.
n*log(n) algorithms are the way to go, though

28
What would be the "least boring" sorting algorithm? (lemmy.world)
submitted 3 days ago* (last edited 3 days ago) by fargeol@lemmy.world to c/data_structures@programming.dev
17 comments fedilink
 

I'm currently working on a little web app that allows the user to sort a list of elements (like a tier-list maker).

Instead of just asking the user to sort the list through drag'n drop, I thought I could run a sorting algorithm that would ask the user every time it needs to make a comparison.

The whole thing would feel a bit magic, since you would have several questions like "Which one do you prefer, A or B?" and get your sorted list.

The question is: which algorithm should I use to keep the user entertained? I don't want to compare A with everything, then B with everything and so on with something like a Bubble Sort, that would be boring.

What do you think about it? Please be aware this is not a big project, just something I make out of curiosity. Thanks in advance!

Edit:
As an example, let's say I want to sort fruits by personal preference.
I have a list [Apple, Banana, Coconut, Durian, Eggplant, Fig, Grape] but no algorithm can tell if I prefer an apple or a banana so it needs to ask me.
What would be the questions an algorithm needs to ask me in order to sort the list of fruits for me?
The idea behind it is not to sort stuff but to spark discussion during the "comparison" step ("Ok, why do you prefer bananas to apples?"), that's why I need successive comparisons to be different, so it keeps the users' interest.

Actors that have been the least believable scientist castings, I’ll start. in c/science_memes@mander.xyz
[–] fargeol@lemmy.world 44 points 1 week ago (3 children)

Dolph Lundgren in Expendables shows some unusual skills in chemical science.

And yes, I know that Dolph Lundgren studied chemistry IRL

Actors that have been the least believable scientist castings, I’ll start. in c/science_memes@mander.xyz
[–] fargeol@lemmy.world 12 points 1 week ago (1 children)

Samuel L. Jackson in Jurassic Park!

What is your absolute favourite track from a video game? in c/asklemmy@lemmy.world
[–] fargeol@lemmy.world 3 points 1 week ago

Shadow of the Colossus - The Opened Way

Google Confirms It Has Been Hacked — Warns User Data Stolen in c/degoogle@lemmy.ml
[–] fargeol@lemmy.world 21 points 1 week ago (2 children)

Let's not forget that Apple iCloud was breached in 2014: https://en.wikipedia.org/wiki/2014_celebrity_nude_photo_leak

How a fish fell from the sky and sparked a fire in this B.C. village in c/nottheonion@lemmy.world
How a fish fell from the sky and sparked a fire in this B.C. village in c/nottheonion@lemmy.world
[–] fargeol@lemmy.world 1 points 1 week ago

🎵 We didn't start the fire! It was always burning since the fish is falling 🎵

55
Is there such a thing as a manually curated search engine? (lemmy.world)
 

When I search for anything on Google or DuckDuckGo, more than half of the results are useless AI generated articles.

Those articles are generated to get in the first results of requests, since the search engine use algorithms to index websites and pages.

If we manually curate "good" websites (newspapers, forums, encyclopedias, anything that can be considered a good source) and only index their contents, would it be possible to create a good ol'fashioned search engine? Does it already exist?

165
Could I render the computer-generated graphics from Toy Story (1995) in real time using a single modern home computer? (lemmy.world)
 

The movie Toy Story needed top-computers in 1995 to render every frame and that took a lot of time (800000 machine-hours according to Wikipedia).

Could it be possible to render it in real time with modern (2025) GPUs on a single home computer?

view more: next ›