Reports:Tasks not implemented in AWK
If AWK is a language you like, or are interested in, please inform your fellow members of the AWK community; this page can't be emptied without your and their participation.
Contents
Not implemented[edit]
These are currently not implemented in AWK. Please implement some if you can. If any tasks are not possible or too complex in AWK, they should not be on this list. To mark a task as such, add {{omit from|AWK}}, preserving the capitalization of the language, to that task. It will appear below under the "Not Considered" section.
A
- AKS test for primes
- ASCII art diagram converter
- AVL tree
- Abbreviations, simple
- Abelian sandpile model
- Abelian sandpile model/Identity
- Accumulator factory
- Achilles numbers
- Algebraic data types
- Almkvist-Giullera formula for pi
- Amb
- Animate a pendulum
- Anonymous recursion
- Apply a digital filter (direct form II transposed)
- Arena storage pool
- Arithmetic-geometric mean/Calculate Pi
- Arithmetic/Rational
- Arithmetic evaluation
- Arithmetic numbers
- Average loop length
B
- Balanced ternary
- Barnsley fern
- Base64 decode data
- Bell numbers
- Bernoulli numbers
- Bin given limits
- Bioinformatics/Sequence mutation
- Biorhythms
- Bitcoin/address validation
- Bitcoin/public point to address
- Bitmap/PPM conversion through a pipe
- Bitmap/Read an image through a pipe
- Brace expansion
- Brilliant numbers
- Brownian tree
- Bulls and cows/Player
- Burrows–Wheeler transform
C
- CRC-32
- Calendar - for "REAL" programmers
- Calkin-Wilf sequence
- Call a foreign-language function
- Call a function in a shared library
- Canny edge detector
- Canonicalize CIDR
- Cartesian product of two or more lists
- Catamorphism
- Catmull–Clark subdivision surface
- Chaocipher
- Chaos game
- Chat server
- Check Machin-like formulas
- Check input device is a terminal
- Check output device is a terminal
- Checkpoint synchronization
- Chernick's Carmichael numbers
- Cholesky decomposition
- Church numerals
- Closures/Value capture
- Color wheel
- Colorful numbers
- Combinations and permutations
- Commatizing numbers
- Compare sorting algorithms' performance
- Compiler/AST interpreter
- Composite numbers k with no single digit factors whose factors are all substrings of k
- Conjugate transpose
- Consecutive primes with ascending or descending differences
- Constrained genericity
- Constrained random points on a circle
- Continued fraction
- Continued fraction/Arithmetic/Construct from rational number
- Convert decimal number to rational
- Convex hull
- Cramer's rule
- Cuban primes
- Currying
- Curzon numbers
- Cut a rectangle
- Cyclotomic polynomial
D
- DNS query
- De Bruijn sequences
- Deal cards for FreeCell
- Deceptive numbers
- Deconvolution/1D
- Deconvolution/2D+
- Deming's Funnel
- Determinant and permanent
- Determine if only one instance is running
- Determine if two triangles overlap
- Dice game probabilities
- Dijkstra's algorithm
- Dining philosophers
- Display a linear combination
- Display an outline as a nested table
- Distributed programming
- Diversity prediction theorem
- Documentation
- Doubly-linked list/Definition
- Doubly-linked list/Element definition
- Doubly-linked list/Element insertion
- Doubly-linked list/Traversal
- Draw a pixel
- Draw a rotating cube
- Duffinian numbers
E
- EKG sequence convergence
- Earliest difference between prime gaps
- Echo server
- Eertree
- Egyptian division
- Egyptian fractions
- Element-wise operations
- Elementary cellular automaton
- Elementary cellular automaton/Infinite length
- Elementary cellular automaton/Random Number Generator
- Elliptic Curve Digital Signature Algorithm
- Elliptic curve arithmetic
- Equal prime and composite sums
- Erdös-Selfridge categorization of primes
- Esthetic numbers
- Euler's constant 0.5772...
- Euler's identity
- Euler method
- Events
- Exceptions
- Exceptions/Catch an exception thrown in a nested call
- Executable library
- Execute Computer/Zero
- Execute HQ9+
- Execute SNUSP
- Execute a Markov algorithm
- Extend your language
- Extensible prime generator
F
- FTP
- Faces from a mesh
- Factorial base numbers indexing permutations of a collection
- Factors of a Mersenne number
- Fairshare between two and more
- Fast Fourier transform
- Faulhaber's formula
- Faulhaber's triangle
- Fermat numbers
- Fibonacci word
- Fibonacci word/fractal
- File size distribution
- Find Chess960 starting position identifier
- Find duplicate files
- Find if a point is within a triangle
- Find largest left truncatable prime in a given base
- Find palindromic numbers in both binary and ternary bases
- Find the intersection of a line with a plane
- First class environments
- First perfect square in base n with n unique digits
- First power of 2 that has leading decimal digits of 12
- Fivenum
- Flatten a list
- Flipping bits game
- Floyd-Warshall algorithm
- Forest fire
- Fork
- Formal power series
- Fortunate numbers
- Four bit adder
- Four is the number of letters in the ...
- Fractal tree
- Fraction reduction
- Fractran
- French Republican calendar
- Function composition
- Functional coverage tree
G
H
I
K
L
- LU decomposition
- LZW compression
- Last letter-first letter
- Latin Squares in reduced form
- Latin Squares in reduced form/Randomizing using Jacobson and Matthews’ Technique
- Legendre prime counting function
- Levenshtein distance/Alignment
- Linear congruential generator
- List comprehensions
- List rooted trees
- Long primes
- Longest common subsequence
- Longest common substring
- Longest increasing subsequence
- Lucky and even lucky numbers
- Ludic numbers
- Lychrel numbers
M
- MAC Vendor Lookup
- MD4
- MD5
- MD5/Implementation
- Machine code
- Magic squares of singly even order
- Main step of GOST 28147-89
- Man or boy test
- Mastermind
- Matrix-exponentiation operator
- Matrix chain multiplication
- Matrix digital rain
- Mayan calendar
- Mayan numerals
- Maze solving
- Median filter
- Mertens function
- Metallic ratios
- Metered concurrency
- Miller–Rabin primality test
- Mind boggling card trick
- Minesweeper game
- Minimal steps down to 1
- Minimum positive multiple in base 10 using only 0 and 1
- Minkowski question-mark function
- Modified random distribution
- Modular arithmetic
- Modular exponentiation
- Monads/List monad
- Monads/Maybe monad
- Monads/Writer monad
- Move-to-front algorithm
- Multi-base primes
- Multi-dimensional array
- Multiple distinct objects
- Multiple regression
- Multiplicative order
- Musical scale
- Mutex
N
- N-smooth numbers
- Named parameters
- Narcissist
- Natural sorting
- Negative base numbers
- Nested function
- Nested templated data
- Next highest int from digits
- Non-continuous subsequences
- Non-decimal radices/Input
- Non-transitive dice
- Nonoblock
- Nonogram solver
- Numbers which are not the sum of distinct squares
- Numeric error propagation
- Numerical and alphabetical suffixes
- Numerical integration
- Numerical integration/Gauss-Legendre Quadrature
O
P
- P-Adic numbers, basic
- P-Adic square roots
- P-value correction
- Padovan n-step number sequences
- Padovan sequence
- Palindromic gapful numbers
- Paraffins
- Parallel brute force
- Parameterized SQL statement
- Parametric polymorphism
- Parse an IP Address
- Parsing/RPN calculator algorithm
- Parsing/Shunting-yard algorithm
- Partial function application
- Particle fountain
- Partition an integer x into n primes
- Partition function P
- Pascal's triangle/Puzzle
- Pascal matrix generation
- Peaceful chess queen armies
- Peano curve
- Pell's equation
- Pell numbers
- Penney's game
- Pentagram
- Pentomino tiling
- Percolation/Bond percolation
- Percolation/Mean cluster density
- Percolation/Mean run density
- Percolation/Site percolation
- Perfect shuffle
- Periodic table
- Peripheral drift illusion
- Perlin noise
- Permutations/Derangements
- Permutations/Rank of a permutation
- Permutations by swapping
- Pi
- Pierpont primes
- Pig the dice game/Player
- Pinstripe/Display
- Pinstripe/Printer
- Pisano period
- Play recorded sounds
- Playfair cipher
- Playing cards
- Plot coordinate pairs
- Pointers and references
- Poker hand analyser
- Polymorphism
- Polynomial long division
- Polyspiral
- Prime conspiracy
- Prime triangle
- Primes - allocate descendants to their ancestors
- Primorial numbers
- Priority queue
- Problem of Apollonius
- Pseudo-random numbers/Combined recursive generator MRG32k3a
- Pseudo-random numbers/PCG32
- Pseudo-random numbers/Splitmix64
- Pseudo-random numbers/Xorshift star
- Pythagoras tree
R
- RCRPG
- RIPEMD-160
- RPG attributes generator
- RSA code
- Ramanujan's constant
- Ramanujan primes/twins
- Ramer-Douglas-Peucker line simplification
- Random Latin squares
- Random number generator (device)
- Random sentence from book
- Range consolidation
- Rare numbers
- Rate counter
- Ray-casting algorithm
- Reduced row echelon form
- Reflection/Get source
- Reflection/List methods
- Reflection/List properties
- Rendezvous
- Rep-string
- Repunit primes
- Resistor mesh
- Retrieve and search chat history
- Return multiple values
- Rhonda numbers
- Rock-paper-scissors
- Roots of a function
- Roots of a quadratic function
- Rosetta Code/Count examples
- Rosetta Code/Find bare lang tags
- Rosetta Code/Find unimplemented tasks
- Rosetta Code/Fix code tags
- Rosetta Code/Rank languages by number of users
- Runtime evaluation
- Runtime evaluation/In an environment
- Ruth-Aaron numbers
S
- S-expressions
- SHA-1
- SHA-256 Merkle tree
- SOAP
- SQL-based authentication
- Safe addition
- Same fringe
- Search a list of records
- Secure temporary file
- Selectively replace multiple instances of a character within a string
- Send an unknown method call
- Send email
- Sequence: nth number with exactly n divisors
- Sequence of primorial primes
- Set
- Set consolidation
- Set of real numbers
- Set puzzle
- Set right-adjacent bits
- Seven-sided dice from five-sided dice
- Shoelace formula for polygonal area
- Shortest common supersequence
- Sierpinski arrowhead curve
- Sierpinski pentagon
- Sierpinski square curve
- Sierpinski triangle/Graphical
- Simple database
- Simple turtle graphics
- Simulate input/Keyboard
- Singly-linked list/Element insertion
- Singly-linked list/Traversal
- Sleeping Beauty problem
- Smallest number k such that k+2^m is composite for all m less than k
- Snake
- Sokoban
- Solve a Hidato puzzle
- Solve a Holy Knight's tour
- Solve a Hopido puzzle
- Solve a Numbrix puzzle
- Solve the no connection puzzle
- Sort an outline at every level
- Sort disjoint sublist
- Sort three variables
- Sorting Algorithms/Circle Sort
- Sorting algorithms/Bead sort
- Sorting algorithms/Cocktail sort with shifting bounds
- Sorting algorithms/Counting sort
- Sorting algorithms/Heapsort
- Sorting algorithms/Merge sort
- Sorting algorithms/Pancake sort
- Sorting algorithms/Patience sort
- Sorting algorithms/Permutation sort
- Sorting algorithms/Radix sort
- Sorting algorithms/Sleep sort
- Sorting algorithms/Stooge sort
- Sorting algorithms/Strand sort
- Sparkline in unicode
- Speech synthesis
- Spelling of ordinal numbers
- Square form factorization
- Stable marriage problem
- State name puzzle
- Statistics/Basic
- Statistics/Normal distribution
- Stern-Brocot sequence
- Stirling numbers of the first kind
- Stirling numbers of the second kind
- Straddling checkerboard
- Strassen's algorithm
- Substitution cipher
- Subtractive generator
- Suffixation of decimal numbers
- Summarize and say sequence
- Super-d numbers
- Superellipse
- Sutherland-Hodgman polygon clipping
T
- Tarjan
- Terminal control/Coloured text
- Terminal control/Cursor movement
- Terminal control/Cursor positioning
- Terminal control/Dimensions
- Terminal control/Hiding the cursor
- Terminal control/Positional read
- Terminal control/Preserve screen
- Ternary logic
- Test a function
- Textonyms
- The ISAAC Cipher
- The sieve of Sundaram
- Thiele's interpolation formula
- Time a function
- Tokenize a string with escaping
- Tonelli-Shanks algorithm
- Topic variable
- Topological sort
- Topswops
- Total circles area
- Tree datastructures
- Tree from nesting levels
- Truth table
- Twelve statements
- Two bullet roulette
U
V
W
Draft tasks without implementation[edit]
These tasks are drafts, meaning they largely need more work to turn them into full tasks. Perhaps you can help by trying to implement them in AWK (after all, one of the key requirements for a task being non-draft is multiple implementations, preferably in widely different languages) but be aware that this may be difficult because of lack of definition of the task itself.
A
B
C
- CLI-based maze-game
- Camel case and snake case
- Card shuffles
- Chebyshev coefficients
- Checksumcolor
- Chemical calculator
- Chess player
- Cipolla's algorithm
- Combinations with repetitions/Square digit chain
- Compiler/Preprocessor
- Compiler/Verifying syntax
- Conjugate a Latin verb
- Continued fraction/Arithmetic/G(matrix ng, continued fraction n)
- Continued fraction/Arithmetic/G(matrix ng, continued fraction n1, continued fraction n2)
- Coprime triplets
- Count the coins/0-1
- Create your own text control codes
- Cross compilation
- Curve that touches three points
- Cycle detection
- Cycles of a permutation
D
- Data Encryption Standard
- Dating agency
- Decimal floating point number to binary
- Diophantine linear system solving
- Discrete Fourier transform
- Distinct palindromes within decimal numbers
- Distinct power numbers
- Distribution of 0 digits in factorial series
- Divide a rectangle into a number of unequal triangles
- Dominoes
- Doomsday rule
- Doubly-linked list/Element removal
- Draw pixel 2
F
G
I
L
M
N
P
- Pandigital prime
- Parse EBNF
- Particle swarm optimization
- Penrose tiling
- Perceptron
- Permutations with some identical elements
- Permuted multiples
- Polynomial derivative
- Polynomial synthetic division
- Powerful numbers
- Practical numbers
- Price list behind API
- Print debugging statement
- Print itself
- Process SMIL directives in XML data
- Pseudorandom number generator image
R
- Railway circuit
- Ramanujan primes
- Range modifications
- Raster bars
- Readline interface
- Recursive descent parser generator
- Red black tree sort
- Remote agent/Agent interface
- Remote agent/Agent logic
- Remote agent/Simulation
- Resistance calculator
- Resistance network calculator
- Reverse the gender of a string
- Robots
- Rodrigues’ rotation formula
- Rosetta Code/List authors of task descriptions
- Rosetta Code/Run examples
- Rosetta Code/Tasks without examples
- Run as a daemon or service
S
- Sanitize user input
- Sattolo cycle
- Segmentation fault protection
- Self-hosting compiler
- Separate the house number from the street name
- Sierpinski curve
- Simulated annealing
- Sine wave
- Singly-linked list/Element removal
- Smallest enclosing circle problem
- Smallest multiple
- Smallest numbers
- Solve a Rubik's Cube
- Solve hanging lantern problem
- Solve triangle solitare puzzle
- Solving coin problems
- Sorting algorithms/Cycle sort
- Sorting algorithms/Tree sort on a linked list
- Special divisors
- Special factorials
- Spoof game
- Square root by hand
- Starting a web browser
- Subset sum problem
- Suffix tree
- Sum data type
- Sunflower fractal
T
- Tamagotchi emulator
- Terminal control/Restricted width positional input/No wrapping
- Terminal control/Restricted width positional input/With wrapping
- Tetris
- Text completion
- Text to HTML
- Three word location
- Time-based one-time password algorithm
- Topological sort/Extracted top item
- Transliterate English text using the Greek alphabet
- Transportation problem
- Tropical algebra overloading
U
W
Requiring Attention[edit]
Examples[edit]
These tasks have implementations in AWK, but somebody, somewhere, decided that the example implementation was faulty or in some other way requiring attention. If you're familiar with the task and language, please consider reviewing/correcting the example and removing the notice.
Other pages[edit]
These are other pages related to AWK which require attention; with your knowledge and assistance, we can improve the quality of the site's content.
Not Considered[edit]
These tasks are not generally counted toward "unimplemented", as somebody, somewhere, decided that AWK was inappropriate for these tasks, or implementations of them would be unenlightening. Feel free to try your hand at them anyway.
A
B
C
G
P
S
End of List[edit]
Again, feel free to try your hand at any of the tasks listed on this page.