I was looking about code golf and ended up in a page about Kolmogorov Complexity, interesting concept, how we can relate the complexity of something with how hard it is to describe it in any known language
@ConorO'Brien In my case this was before Edge was a thing. I agree Edge is marginally better than IE but I'm not a fan of either. I do Windows browsing on Chrome at work.
> Update: Since the writing of this article, SourceForge has been sold to a new company that stopped the DevShare program discussed in this article. We’re leaving this article here for historical reference, but it has since stopped these shady practices.
For this challenge, when given a list of (x,y) points your submission needs to output a polynomial function that goes through all of them.
For example, if your points were [(0,0), (2,5)], you could return y = 2.5*x or y = x + 1/4x^2.
All points passed in will consist only of integers
Two point...
(edited to fit the answer)
Looking the "Array" section in the bash(1) man page, I didn't find a way to slice a bash array.
So I came up with this overly complicated function:
#!/bin/bash
# @brief: slice a bash array
# @arg1: output-name
# @arg2: input-name
# @args: seq args
# -------------...
Disclaimer: Levenshtein coding is completely unrelated to the Levenshtein edit distance metric.
<Insert long story about why Levenshtein codes need to be calculated here.>
The code
Levenshtein coding is a system of assigning binary codes to nonnegative integers that retains some weird property...
As I understand it, for our purposes a language is more or less defined by its implementation. That's one of the reasons why a program like Vim can also be "language". You just count keystrokes instead of bytes.
But consider the case of Haskell with its standard compiler + interpreter of ghc/ghc...
It is a little silly, because e.g. its tag gold badge is very easy to get (I got it without noticing… I was very confused about suddenly having gold, one day)
For this challenge, when given a list of (x,y) points your submission needs to output a polynomial function that goes through all of them.
For example, if your points were [(0,0), (2,5)], you could return y = 2.5*x or y = x + 1/4x^2.
All points passed in will consist only of integers
Two point...
(edited to fit the answer)
Looking the "Array" section in the bash(1) man page, I didn't find a way to slice a bash array.
So I came up with this overly complicated function:
#!/bin/bash
# @brief: slice a bash array
# @arg1: output-name
# @arg2: input-name
# @args: seq args
# -------------...
Disclaimer: Levenshtein coding is completely unrelated to the Levenshtein edit distance metric.
<Insert long story about why Levenshtein codes need to be calculated here.>
The code
Levenshtein coding is a system of assigning binary codes to nonnegative integers that retains some weird property...
