Master Rust from core practice to 100+ recipes, plus network programming and automation for protocols, packet analysis, and ops-ready tooling.

Introduction to R for social researchers. Learn data preparation, visualisation, and core statistical methods in R with practical, applied examples.

Master Protégé and EKA with this hands-on pizza.owl guide. Build ontology-based meta-models and knowledge graphs through "Diagramming as Code."

Contribute to Ankit8848/dsa-rust development by creating an account on GitHub.

API documentation for the Rust `interval_tree` mod in crate `bio`.

submitted by fargeol to data_structures 20 points | 16 comments 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.