Given a list of at least three distinct positive integers, output a permutation of that list that isn't sorted in ascending or decending order. Examples 1,2,3 -> 2,1,3 or 3,1,2 1,2,3,3 -> 2,1,3,3 or 3,1,2,3 or 1,3,2,3 etc..
All your base 97 are belong to us
code-challengebase-conversion
Golfing languages are often at a very unfair advantage. When inspecting the individual bytes of those program, it immediately becomes clear why: they use all 8 bits to the byte, by using code pages that have 256 characters! There m...
Anonymous
25
Quite often I find that I am repeating myself when creating a challenge. For example, usually I have to retype the definition of "random" in all of my posts, or I have to specify the same thing about how reasonable input and output can be provided in every challenge.
This post is meant to be a c...
0
So, I have a question that I want to create that involves creating the fastest-compiling version of a programming puzzle. Like fastest-code, submissions will have to be scored on a standardized machine or a specified virtual machine. This tag would work for compiled languages only, since you can'...
In computer science, a programming language is said to have first-class functions if it treats functions as first-class citizens. Specifically, this means the language supports passing functions as arguments to other functions, returning them as the values from other functions, and assigning them to variables or storing them in data structures. Some programming language theorists require support for anonymous functions (function literals) as well. In languages with first-class functions, the names of functions do not have any special status; they are treated like ordinary variables with a function...
In mathematics, injections, surjections and bijections are classes of functions distinguished by the manner in which arguments (input expressions from the domain) and images (output expressions from the codomain) are related or mapped to each other.
A function maps elements from its domain to elements in its codomain. Given a function
f
:
X
→
Y
{\displaystyle f:\;X\to Y}
The function is injective (one-to-one) if every element of the codomain is mapped to by at most one element of the domain. An injective function...
-1
Fastest Compiling Fibonacci Sequence compiler fibonacci fastest-compiling
Your task is to create a program which takes one numerical input and outputs all numbers in the Fibonacci sequence up to that point. However, you will not be scored on its bytecount or how many upvotes it gets. You will be...
