This programming language may be used to instruct a computer to perform a task.
|Execution method:||Compiled (machine code)|
|Parameter passing methods:||By reference, By value|
If you know 11l, please write code for some of the tasks not implemented in 11l.
The design of 11l is aimed to achieve as much conciseness as possible.
The evident distinction of 11l from all other existing programming languages is its keywords are organized in a tree, not just a list.
There are 11 keywords at the root of that tree, and each word can be written as one letter:
C, I, E, F, L, N, R, S, T, V, X.
Pages in category "11l"
The following 65 pages are in this category, out of 65 total.
- ABC Problem
- Abundant, deficient and perfect number classifications
- Align columns
- Almost prime
- Amicable pairs
- Anagrams/Deranged anagrams
- Anonymous recursion
- Apply a callback to an array
- Arithmetic evaluation
- Arithmetic-geometric mean
- Array concatenation
- Array length
- Associative array/Creation
- Associative array/Iteration
- Averages/Arithmetic mean
- Averages/Mean angle
- Averages/Mean time of day
- Averages/Pythagorean means
- Averages/Root mean square
- Averages/Simple moving average
- Caesar cipher
- Calculating the value of e
- Cantor set
- Carmichael 3 strong pseudoprimes
- Cartesian product of two or more lists
- Case-sensitivity of identifiers
- Catalan numbers
- Catalan numbers/Pascal's triangle
- Character codes
- Check that file exists
- Chinese remainder theorem
- Comma quibbling
- Command-line arguments
- Compare a list of strings
- Compound data type
- Conditional structures
- Constrained random points on a circle
- Continued fraction
- Convert seconds to compound duration