Category:Quackery: Difference between revisions
Content added Content deleted
(removed link to defunct facebook group) |
m (typo) |
||
| Line 8: | Line 8: | ||
It is coded as a Python 3 function in under 48k of Pythonscript, half of which is a string of Quackery code. |
It is coded as a Python 3 function in under 48k of Pythonscript, half of which is a string of Quackery code. |
||
The Quackery GitHub repository, which includes the Quackery manual "The Book of Quackery" in pdf form, is at https://github.com/GordonCharlton/Quackery |
The Quackery GitHub repository, which includes the Quackery manual "The Book of Quackery" in pdf form, is at [https://github.com/GordonCharlton/Quackery github.com/GordonCharlton/Quackery]. |
||
Revision as of 17:32, 13 June 2021
This programming language may be used to instruct a computer to perform a task.
| See Also: |
|
|---|
Quackery is an implementation of Quackery.
Other implementations of Quackery.
Quackery is an open source, lightweight, entry level concatenative language for educational and recreational programming.
It is coded as a Python 3 function in under 48k of Pythonscript, half of which is a string of Quackery code.
The Quackery GitHub repository, which includes the Quackery manual "The Book of Quackery" in pdf form, is at github.com/GordonCharlton/Quackery.
Pages in category "Quackery"
The following 200 pages are in this category, out of 702 total.
(previous page) (next page)A
- A+B
- ABC problem
- ABC words
- Abundant odd numbers
- Abundant, deficient and perfect number classifications
- Accumulator factory
- Achilles numbers
- Ackermann function
- Additive primes
- Address of a variable
- AKS test for primes
- Almkvist-Giullera formula for pi
- Almost prime
- Alternade words
- Amicable pairs
- Anagrams
- Anagrams/Deranged anagrams
- Angle difference between two bearings
- Anonymous recursion
- Anti-primes
- Append numbers at same position in strings
- Apply a callback to an array
- Arbitrary-precision integers (included)
- Archimedean spiral
- Arithmetic derivative
- Arithmetic numbers
- Arithmetic-geometric mean
- Arithmetic/Integer
- Arithmetic/Rational
- Array concatenation
- Array length
- Arrays
- Ascending primes
- Attractive numbers
- Average loop length
- Averages/Arithmetic mean
- Averages/Mode
- Averages/Pythagorean means
- Averages/Root mean square
- Averages/Simple moving average
B
- Babbage problem
- Bacon cipher
- Balanced brackets
- Barnsley fern
- Base 16 numbers needing a to f
- Base58Check encoding
- Bell numbers
- Bernoulli numbers
- Bifid cipher
- Bin given limits
- Binary digits
- Binary search
- Bioinformatics/base count
- Bioinformatics/Sequence mutation
- Bitwise operations
- Blum integer
- Boolean values
- Box the compass
- Brazilian numbers
- Brilliant numbers
- Bulls and cows
C
- Caesar cipher
- Calculating the value of e
- Calkin-Wilf sequence
- Call a function
- Call an object method
- Calmo numbers
- Camel case and snake case
- Cantor set
- Cartesian product of two or more lists
- Case-sensitivity of identifiers
- Casting out nines
- Catalan numbers
- Catalan numbers/Pascal's triangle
- Catamorphism
- Change e letters to i in words
- Changeable words
- Chaos game
- Character codes
- Check input device is a terminal
- Check output device is a terminal
- Chinese zodiac
- Church numerals
- Cistercian numerals
- Closures/Value capture
- Code Golf: Code Golf
- Collect and sort square numbers in ascending order from three lists
- Colour pinstripe/Display
- Combinations
- Combinations with repetitions
- Comma quibbling
- Comments
- Common list elements
- Common sorted list
- Compare a list of strings
- Compare length of two strings
- Compile-time calculation
- Compound data type
- Concatenate two primes is also prime
- Conditional structures
- Constrained random points on a circle
- Continued fraction
- Continued fraction/Arithmetic/Construct from rational number
- Convert decimal number to rational
- Convert seconds to compound duration
- Conway's Game of Life
- Coprime triplets
- Coprimes
- Copy a string
- Count how many vowels and consonants occur in a string
- Count in factors
- Count in octal
- Count occurrences of a substring
- Count the coins
- Cousin primes
- CRC-32
- Create a two-dimensional array at runtime
- Cullen and Woodall numbers
- Currency
- Currying
- Curzon numbers
- CUSIP
- Cycle detection
- Cycles of a permutation
D
- Damm algorithm
- Day of the week
- Day of the week of Christmas and New Year
- Days between dates
- De Polignac numbers
- Deal cards for FreeCell
- Deceptive numbers
- Decision tables
- Decorate-sort-undecorate idiom
- Department numbers
- Descending primes
- Determine if a string has all the same characters
- Determine if a string has all unique characters
- Determine if a string is collapsible
- Determine if a string is numeric
- Digit fifth powers
- Digital root
- Digital root/Multiplicative digital root
- Disarium numbers
- Distinct power numbers
- Dot product
- Dragon curve
- Draw a clock
- Draw a cuboid
- Duffinian numbers
- Dynamic variable names
E
- Eban numbers
- Egyptian division
- Elementary cellular automaton
- Emirp primes
- Empty program
- Empty string
- Enforced immutability
- Engel expansion
- Equal prime and composite sums
- Equilibrium index
- Esthetic numbers
- Ethiopian multiplication
- Evaluate binomial coefficients
- Even or odd
- Exactly three adjacent 3 in lists
- Exceptions
- Exceptions/Catch an exception thrown in a nested call
- Execute a system command
- Execute Brain****
- Execute HQ9+
- Exponentiation operator
- Exponentiation order
- Extend your language
- Extra primes
- Extract file extension
F
- Factorial
- Factorial base numbers indexing permutations of a collection
- Factorial primes
- Factorions
- Factors of an integer
- Fairshare between two and more
- Farey sequence
- Fermat pseudoprimes
- Fibonacci n-step number sequences
- Fibonacci sequence
- Fibonacci word/fractal
- File input/output
- Filter
- Find adjacent primes which differ by a square integer
- Find common directory path
- Find first and last set bit of a long integer
- Find first missing positive