@AviFS I agree with HN in that we shouldn't put too much in the modal, it's already very long. That said, I don't see a problem with changing it to "We host coding challenges, such as code golf or fastest code competitions, and related questions, such as code golfing tips"
(I chose fastest code as I think it is the second highest used challenge type after golf, ignoring code-challenge, as is generally easier to understand than "Cops and Robbers" or "King of the Hill". Open to suggestions tho)
@lyxal I still have ding ding ding ding ding ding ding ding-ding-ding. ding ding ding ding ding ding ding ding-ding-ding-ding-ding-ding ๐ข๐ฎ๐ฐ๐จ๐ถ๐ด from the Lyxal army shenanigans.
answer-chaining: Each answer influences how newer answers work. Often ends when there are no new answer in a specific time and the last one wins. See What answer-chaining scoring criteria promote collaboration? for more.
ast-golf: The answer with the fewest nodes on its abstract syntax tree w...
@StackMeter I'm not voting to reopen until it's got test cases, a winning criterion, and we've figured out if wherever it was probably stolen from is okay with that, but I went and solved it in Brachylog and I actually had to use ` for once
it seems like there's a lot of times i run some brachylog on my machine that behaves fine on tio but endlessly cycles choicepoints when i run it locally
so ` is implemented as *-> 1=1, and the soft cut behavior is actually entirely unrelated to why it fixes the แน bug, it just happens to break direct unification which is somehow what the problem is
like you can just use A and that also fixes it
???
and แน is literally just implemented as constraintM([_,_|_]).
how can anything go wrong with that
i guess something just breaks inside โ if it has that constraint on its output
โแน shits itself because it tries infinitely many lengths for แน because it goes to a branch of the code that assumes it has a single length already
In computer science, comparator networks are abstract devices built up of a fixed number of "wires", carrying values, and comparator modules that connect pairs of wires, swapping the values on the wires if they are not in a desired order. Such networks are typically designed to perform sorting on fixed numbers of values, in which case they are called sorting networks.
Sorting networks differ from general comparison sorts in that they are not capable of handling arbitrarily large inputs, and in that their sequence of comparisons is set in advance, regardless of the outcome of previous comparisons...
@felipa It first sorts based on the minimum integer in the list, then does a recursive call to g with the filtered array (all but the minimum) if there is more than 1 element in n. Otherwise return the singleton list. Then takes third element of that sorted list.
Volume III of Knuth's The Art of Computer Programming (chapter 5, verse 3.2) includes the following table listing the exact minimum number of comparisons required to select the $t$th smallest element from an unsorted set of size $n$, for all $1\le t \le n\le 10$. This table, along with the well-...
@Adรกm Not really. If you do n[0]<n[1]&&n[0]<n[2]... for each element you'll find the minimum pretty quickly. Then if n[i] is the minimum, then for each element n[0]>n[i]&&n[0]<n[1]...&&n[0]<n[i-1]&&n[0]<n[i+1]..., and eventually you'll find the second lowest, etc.
oh what a coincidence. I'm doing a machine learning course but still in the intro about pandas to get a grip on how to perform certain simple data analysis tasks and I'm on a part about sorting.
@felipa โ/ finds the smallest value, โขโณ index of that in the argument, โณโโข all the indices, โ builds an all-true mask with a false at that position, โข(/โจ) uses that mask to filter the argument, (โฆ)โฃ2 repeats that twice, โ/ finds the smallest value.
CMC: Given a list and a separator, join the list with the separator. You may not use a builtin function that does exactly this (e.g. Python's .join or Jelly's j)
CMC: Change a github pages url to the link of a github repo; for example https://username.github.io/reponame becomes https://github.com/username/reponame