Tasks not implemented in Ada
Appearance
Awareness
If Ada is a language you like, or are interested in, please inform your fellow members of the Ada community; this page can't be emptied without your and their participation.
If Ada is a language you like, or are interested in, please inform your fellow members of the Ada community; this page can't be emptied without your and their participation.
Tasks not implemented in Ada
2
A
- ADFGVX cipher
- ASCII art diagram converter
- Active Directory/Connect
- Active Directory/Search for a user
- Aliquot sequence classifications
- Almkvist-Giullera formula for pi
- Anaprimes
- Animated Spinners
- Arithmetic derivative
- Autogram checker
B
- Babylonian spiral
- Bernstein basis polynomials
- Bioinformatics/Global alignment
- Biorhythms
- Bitcoin/public point to address
- Bitmap/PPM conversion through a pipe
- Bitmap/Read an image through a pipe
- Blum integer
- Boustrophedon transform
- Boyer-Moore string search
- Brazilian numbers
- Brilliant numbers
- Burrows–Wheeler transform
C
- Calkin-Wilf sequence
- Camel case and snake case
- Canny edge detector
- Canonicalize CIDR
- Casting out nines
- Catmull–Clark subdivision surface
- Chaos game
- Check Machin-like formulas
- Check if a polygon overlaps with a rectangle
- Check if two polygons overlap
- Chernick's Carmichael numbers
- Church numerals
- Circles of given radius through two points
- Circular primes
- Cistercian numerals
- Color of a screen pixel
- Color quantization
- Colorful numbers
- Commatizing numbers
- Compare sorting algorithms' performance
- Compiler/AST interpreter
- Compiler/code generator
- Compiler/syntax analyzer
- Composite numbers k with no single digit factors whose factors are all substrings of k
- Consecutive primes with ascending or descending differences
- Create a file on magnetic tape
- Cullen and Woodall numbers
- Curzon numbers
- Cut a rectangle
- Cycles of a permutation
- Cyclops numbers
- Cyclotomic polynomial
D
- Dating agency
- De Polignac numbers
- Deceptive numbers
- Deconvolution/2D+
- Decorate-sort-undecorate idiom
- Deepcopy
- Descending primes
- Determinant and permanent
- Display an outline as a nested table
- Distance and Bearing
- Distribution of 0 digits in factorial series
- Dominoes
- Doomsday rule
- Duffinian numbers
E
- Earliest difference between prime gaps
- Eertree
- Elementary cellular automaton/Infinite length
- Elementary cellular automaton/Random number generator
- Elliptic Curve Digital Signature Algorithm
- Elliptic curve arithmetic
- Erdös-Selfridge categorization of primes
- Erdős-Nicolas numbers
- Esthetic numbers
- Euclid-Mullin sequence
- Euclidean rhythm
- Execute Computer/Zero
F
- Faces from a mesh
- Factorial base numbers indexing permutations of a collection
- Factorions
- Factorize string into Lyndon words
- Fairshare between two and more
- Farey sequence
- Faulhaber's formula
- Faulhaber's triangle
- Fermat numbers
- Fermat pseudoprimes
- Fibonacci word/fractal
- Find Chess960 starting position identifier
- Find duplicate files
- Find largest left truncatable prime in a given base
- First perfect square in base n with n unique digits
- First power of 2 that has leading decimal digits of 12
- Fortunate numbers
- Four is magic
- Four is the number of letters in the ...
- French Republican calendar
- Function frequency
- Functional coverage tree
G
- GSTrans string conversion
- Galton box animation
- Gauss-Jordan matrix inversion
- Gaussian primes
- Generate Chess960 starting position
- Generate random chess position
- Go Fish
- Goldbach's comet
- Gotchas
- Graph colouring
- Greatest prime dividing the n-th cubefree number
- Greedy algorithm for Egyptian fractions
H
- HTTPS/Authenticated
- HTTPS/Client-authenticated
- Harmonic series
- Harriss Spiral
- Hash join
- Hashtron inference
- Hex dump
- Home primes
- Honaker primes
- Hough transform
I
- I before E except after C
- I'm a software engineer, get me out of here
- Idoneal numbers
- Imaginary base numbers
- Inconsummate numbers in base 10
- Increasing gaps between consecutive Niven numbers
- Index finite lists of positive integers
- Inner classes
- Intersecting number wheels
- Isograms and heterograms
J
- JSON pointer
- Jacobi symbol
- Jacobsthal numbers
- Jaro-Winkler distance
- Jordan-Pólya numbers
- Joystick position
K
- K-d tree
- K-means++ clustering
- Keyboard macros
- Klarner-Rado sequence
- Knapsack problem/Bounded
- Kolakoski sequence
- Kosaraju
L
- Lah numbers
- Latin Squares in reduced form
- Left factorials
- Legendre prime counting function
- Levenshtein distance/Alignment
- List rooted trees
- Long literals, with continuations
- Long primes
- Longest increasing subsequence
- Lucky and even lucky numbers
- Lychrel numbers
- Lyndon word
M
- Machine code
- Magic squares of doubly even order
- Magic squares of singly even order
- Magnanimous numbers
- Main step of GOST 28147-89
- Mayan calendar
- Mayan numerals
- Meissel–Mertens constant
- Merge and aggregate datasets
- Mertens function
- Metallic ratios
- Minimal steps down to 1
- Minimum multiple of m where digital sum equals m
- Minimum positive multiple in base 10 using only 0 and 1
- Minkowski question-mark function
- Monads/List monad
- Monads/Maybe monad
- Monads/Writer monad
- Motzkin numbers
- Multi-base primes
- Möbius function
N
- N-smooth numbers
- Naming conventions
- Natural sorting
- Nautical bell
- Nested templated data
- Non-transitive dice
- Nonoblock
- Nonogram solver
- Numbers k such that the last letter of k is the same as the first letter of k+1
- Numbers which are not the sum of distinct squares
- Numbers which are the cube roots of the product of their proper divisors
- Numerical and alphabetical suffixes
- Numerical integration/Gauss-Legendre Quadrature
O
- O'Halloran numbers
- Old Russian measure of length
- One-time pad
- OpenWebNet password
- Order by pair comparisons
- Order disjoint list items
- Ormiston triples
- Own digits power sum
P
- P-Adic numbers, basic
- P-Adic square roots
- P-value correction
- Padovan n-step number sequences
- Padovan sequence
- Pairs with common factors
- Palindromic gapful numbers
- Pan base non-primes
- Pancake numbers
- Paraffins
- Parse an IP Address
- Parsing/Shunting-yard algorithm
- Particle fountain
- Partition an integer x into n primes
- Partition function P
- Peaceful chess queen armies
- Pell numbers
- Penta-power prime seeds
- Pentomino tiling
- Percolation/Bond percolation
- Percolation/Mean cluster density
- Percolation/Mean run density
- Percolation/Site percolation
- Perfect totient numbers
- Periodic table
- Perlin noise
- Permutations/Rank of a permutation
- Pierpont primes
- Pisano period
- Plasma effect
- Playfair cipher
- Polyspiral
- Prime conspiracy
- Prime numbers whose neighboring pairs are tetraprimes
- Prime triangle
- Primes - allocate descendants to their ancestors
- Primes: n*2^m+1
- Primorial numbers
- Product of min and max prime factors
- Pythagorean quadruples
Q
R
- RCRPG
- RPG attributes generator
- Radical of an integer
- Ramanujan primes/twins
- Ramanujan's constant
- Ramer-Douglas-Peucker line simplification
- Random Latin squares
- Random sentence from book
- Ranking methods
- Rare numbers
- Read a file character by character/UTF8
- Recaman's sequence
- Reflection/Get source
- Reflection/List methods
- Reflection/List properties
- Repunit primes
- Retrieve and search chat history
- Rhonda numbers
- Riordan numbers
- Rosetta Code/Find bare lang tags
- Rosetta Code/Fix code tags
- Rosetta Code/Rank languages by number of users
- Ruth-Aaron numbers
S
- SHA-256 Merkle tree
- SOAP
- SQL-based authentication
- Sailors, coconuts and a monkey problem
- Scope/Function names and labels
- Sealed classes and methods
- Search in paragraph's text
- Self numbers
- Sequence of primorial primes
- Sequence: nth number with exactly n divisors
- Sequence: smallest number with exactly n divisors
- Set of real numbers
- Set, the card game
- Sexy primes
- Sierpinski pentagon
- Sierpinski triangle/Graphical
- Sieve of Pritchard
- Simple database
- Simulate input/Keyboard
- Simulate input/Mouse
- Singular value decomposition
- Sisyphus sequence
- Sleeping Beauty problem
- Smallest number k such that k+2^m is composite for all m less than k
- Smarandache prime-digital sequence
- Smarandache-Wellin primes
- Sokoban
- Solve a Hidato puzzle
- Solve a Hopido puzzle
- Solve a Numbrix puzzle
- Sorensen–Dice coefficient
- Sort an outline at every level
- Sorting Algorithms/Circle Sort
- Sorting algorithms/Bead sort
- Sorting algorithms/Cocktail sort with shifting bounds
- Sorting algorithms/Strand sort
- Sparkline in unicode
- Speech synthesis
- Spelling of ordinal numbers
- Sphenic numbers
- Square form factorization
- Square-free integers
- State name puzzle
- Statistics/Normal distribution
- Steffensen's method
- Stirling numbers of the first kind
- Stirling numbers of the second kind
- Straddling checkerboard
- Strassen's algorithm
- Strong and weak primes
- Sub-unit squares
- Successive prime differences
- Suffixation of decimal numbers
- Sum and product puzzle
- Summarize primes
- Super-Poulet numbers
- Super-d numbers
- Superpermutation minimisation
- Sylvester's sequence
- Sync subtitles
T
- Table creation/Postal addresses
- Tarjan
- Tau function
- Tau number
- Taxicab numbers
- Teacup rim text
- Terminal control/Dimensions
- Terminal control/Positional read
- Terminal control/Preserve screen
- Terminal control/Unicode output
- Test integerness
- Textonyms
- The sieve of Sundaram
- Tonelli-Shanks algorithm
- Topic variable
- Total circles area
- Transliterate English text using the Greek alphabet
- Tree datastructures
- Tree from nesting levels
- Tropical algebra overloading
- Truth table
- Tupper's self-referential formula
- Twin primes
- Two bullet roulette
- Two's complement
U
- Ukkonen’s suffix tree construction
- Ultra useful primes
- Undulating numbers
- Universal Lambda Machine
- Unprimeable numbers
- Untouchable numbers
- Update a configuration file
V
- Vampire number
- Variable declaration reset
- Variadic fixed-point combinator
- Vector
- Verhoeff algorithm
- Video display modes
- Vogel's approximation method
- Voronoi diagram
W
- Wagstaff primes
- Wasteful, equidigital and frugal numbers
- Wilson primes of order n
- Window creation/X11
- Window management
- Wordiff
- Wordle comparison
- World Cup group stage
- Worthwhile task shaving
- Write to Windows event log
X
Y
Z
Draft tasks not implemented in Ada
1
3
A
- A* search algorithm
- ASCII control characters
- Addition chains
- Addition-chain exponentiation
- Apéry's constant
- Arithmetic coding/As a generalized change of radix
- Audio alarm
- Audio frequency generator
- Audio overlap loop
B
- B-spline
- Banker's algorithm
- Base58Check encoding
- Bilinear interpolation
- Binomial transform
- Black box
- Blackjack strategy
- Boids
- Brace expansion using ranges
- Brzozowski algebraic method
C
- CLI-based maze-game
- CORDIC
- Calmo numbers
- CalmoSoft primes
- Card shuffles
- Carmichael lambda function
- Centroid of a set of N-dimensional points
- Chebyshev coefficients
- Checksumcolor
- Chemical calculator
- Chess player
- Cipolla's algorithm
- Code segment unload
- Collect and sort square numbers in ascending order from three lists
- Color separation
- Combinations with repetitions/Square digit chain
- Compiler/Preprocessor
- Compiler/Simple file inclusion pre processor
- Compiler/Verifying syntax
- Conjugate a Latin verb
- Consistent overhead byte stuffing
- Continued fraction convergents
- Convert CSV records to TSV
- Coprime triplets
- Coprimes
- Count the coins/0-1
- Countdown
- Create an executable for a program in an interpreted language
- Create an object/Native demonstration
- Create your own text control codes
- Cross compilation
- Cubic special primes
D
- Data Encryption Standard
- Diophantine linear system solving
- Discrete Fourier transform
- Distinct palindromes within decimal numbers
- Divide a rectangle into a number of unequal triangles
- Double Twin Primes
E
- Eisenstein primes
- Elevator simulation
- Engel expansion
- English cardinal anagrams
- Erdős-primes
- Erdős–Woods numbers
- Even numbers which cannot be expressed as the sum of two twin primes
- Execute CopyPasta Language
- Exponential digital sums
- Extended Straddling Checkerboard
- External sort
F
- Factor-perfect numbers
- Fibonacci heap
- Fibonacci matrix-exponentiation
- Find URI in text
- Find adjacent primes which differ by a square integer
- Find first missing positive
- Find squares n where n+1 is prime
- Finite state machine
- Forbidden numbers
- Free polyominoes enumeration
- Frobenius numbers
G
- Generalised floating point addition
- Generalised floating point multiplication
- Geohash
- Geometric algebra
- Goodstein Sequence
- Gradient descent
- Greed
H
I
- IPC via named pipe
- IRC gateway
- Iccanobif primes
- Implicit type conversion
- Integer long division
- Interactive help
- Inventory sequence
- Iterators
J
K
L
- L-system
- Lagrange Interpolation
- Largest difference between adjacent primes
- Largest palindrome product
- Largest prime factor
- Largest product in a grid
- Latin Squares in reduced form/Randomizing using Jacobson and Matthews' technique
- Launch rocket with countdown and acceleration in stdout
- Least m such that n! + m is prime
- Line circle intersection
- Linux CPU utilization
- Long stairs
- Longest palindromic substrings
- Lucas-Carmichael numbers
M
- Magic numbers
- Make a backup file
- Marching squares
- Markov chain text generator
- McNaughton-Yamada-Thompson algorithm
- Mersenne primes
- Minimum number of cells after, before, above and below NxN squares
- Minimum primes
- Montgomery reduction
- Morpion solitaire
- Most frequent k chars distance
- Multidimensional Newton-Raphson method
- Multiplicatively perfect numbers
- Multiton
N
- N-body problem
- N-grams
- N-queens minimum and knights and bishops
- NYSIIS
- Names to numbers
- Native shebang
- Neighbour primes
- Next special primes
- Nice primes
- Nimber arithmetic
- Number triplets game
- Numbers in base 10 that are palindromic in bases 2, 4, and 16
- Numbers whose binary and ternary digit sums are prime
- Numbers whose count of divisors is prime
- Numbers with prime digits whose sum is 13
O
- Odd and square numbers
- Odd squarefree semiprimes
- One-two primes
- OpenGL pixel shader
- OpenGL/Utah teapot
- Ormiston pairs
P
- Palindromic primes
- Palindromic primes in base 16
- Pandigital prime
- Parse EBNF
- Particle swarm optimization
- Penholodigital squares
- Penrose tiling
- Perceptron
- Permutations with repetitions
- Permutations with some identical elements
- Permuted multiples
- Piprimes
- Pollard's rho algorithm
- Polynomial derivative
- Polynomial synthetic division
- Posit numbers/decoding
- Posit numbers/encoding
- Powerful numbers
- Practical numbers
- Price list behind API
- Prime numbers p for which the sum of primes less than or equal to p is prime
- Prime numbers which contain 123
- Prime reciprocal sum
- Prime triplets
- Prime words
- Primes which contain only one odd digit
- Primes whose first and last number is 3
- Primes whose sum of digits is 25
- Primes with digits in nondecreasing order
- Print debugging statement
- Process SMIL directives in XML data
- Product of divisors
- Proof
- Protecting Memory Secrets
Q
R
- Railway circuit
- Rainbow
- Ramanujan primes
- Ramsey's theorem
- Range modifications
- 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
- Rice coding
- Robots
- Roots of a cubic polynomial
- Rosetta Code/List authors of task descriptions
- Rosetta Code/Run examples
- Rosetta Code/Tasks without examples
- Run as a daemon or service
S
- SEND + MORE = MONEY
- Safe and Sophie Germain primes
- Safe mode
- Sanitize user input
- Sattolo cycle
- Segmentation fault protection
- Selection bias in clinical sciences
- Selective file copy
- Self-hosting compiler
- Separate the house number from the street name
- Shape-Machine
- Sierpinski curve
- Simulated optics experiment/Data analysis
- Simulated optics experiment/Simulator
- Sine wave
- Singly-linked list/Element removal
- Singly-linked list/Reversal
- Smallest enclosing circle problem
- Smallest multiple
- Smallest numbers
- Smallest power of 6 whose decimal expansion contains n
- Smallest square that begins with n
- Snake and ladder
- Solve a Rubik's cube
- Solve equations with substitution method
- Solve hanging lantern problem
- Solve triangle solitaire puzzle
- Solving coin problems
- Sort primes from list to a list
- Sorting algorithms/Cycle sort
- Sorting algorithms/Tree sort on a linked list
- Special divisors
- Special factorials
- Special neighbor primes
- Special pythagorean triplet
- Spoof game
- Square root by hand
- Starting a web browser
- Statistics/Chi-squared distribution
- Steady squares
- Strange plus numbers
- Strange unique prime triplets
- Sturmian word
- Substring primes
- Suffix tree
- Sum of divisors
- Sum of primes in odd positions is prime
- Sum of square and cube digits of an integer are primes
- Sum of the digits of n is substring of n
- Sum of two adjacent numbers are primes
- Summation of primes
- Sunflower fractal
- Syntax highlighting using Mediawiki formatting
- Szymański's algorithm
T
- Table creation
- Tamagotchi emulator
- Terminal control/Restricted width positional input/No wrapping
- Terminal control/Restricted width positional input/With wrapping
- Tetris
- Text completion
- Text to HTML
- The ISAAC cipher
- Time conventions and conversions
- Time-based one-time password algorithm
- Topological sort/Extracted top item
- Transportation problem
- Triangular numbers
- Two sum
- Type detection
U
- URL shortener
- Unicode polynomial equation
- Unit testing
- Uno (card game)
- Untrusted environment
- Use a REST API
- User defined pipe and redirection operators
- Using a speech engine to highlight words
V
W
- Wave function collapse
- Waveform analysis/Doh ray me
- Waveform analysis/Top and tail
- Weather routing
- WebGL rotating F
- Welch's t-test
- WiktionaryDumps to words
- Word break problem
- Words from neighbour ones
X
Tasks omitted from Ada
A
D
E
F
I
M
O
R
S
Y
End of List
Again, feel free to try your hand at any of the tasks listed on this page.