Reports:Tasks not implemented in Fortran
From Rosetta Code
Awareness
If Fortran is a language you like, or are interested in, please inform your fellow members of the Fortran community; this page can't be emptied without your and their participation.
If Fortran is a language you like, or are interested in, please inform your fellow members of the Fortran community; this page can't be emptied without your and their participation.
Contents
Not implemented[edit]
These are currently not implemented in Fortran. Please implement some if you can. If any tasks are not possible or too complex in Fortran, they should not be on this list. To mark a task as such, add {{omit from|Fortran}}, preserving the capitalization of the language, to that task. It will appear below under the "Not Considered" section.
2
A
- ASCII art diagram converter
- AVL tree
- Abbreviations, automatic
- Abbreviations, easy
- Abbreviations, simple
- Abundant odd numbers
- Active Directory/Connect
- Active Directory/Search for a user
- Active object
- Almost prime
- Amb
- Anagrams/Deranged anagrams
- Angles (geometric), normalization and conversion
- Animation
- Anti-primes
- Apply a digital filter (direct form II transposed)
- Archimedean spiral
- Arithmetic-geometric mean/Calculate Pi
- Arithmetic evaluation
- Assertions
- Associative array/Creation
- Associative array/Iteration
- Associative array/Merging
- Atomic updates
- Attractive numbers
- Average loop length
B
- Balanced ternary
- Base64 decode data
- Bell numbers
- Bernoulli numbers
- Best shuffle
- Binary strings
- Bioinformatics/Sequence mutation
- Bioinformatics/base count
- Bitcoin/address validation
- Bitcoin/public point to address
- Bitmap/PPM conversion through a pipe
- Bitmap/Read an image through a pipe
- Bitwise IO
- Brace expansion
- Brazilian numbers
- Break OO privacy
- Burrows–Wheeler transform
C
- Canny edge detector
- Cantor set
- Cartesian product of two or more lists
- Casting out nines
- Catalan numbers/Pascal's triangle
- Catmull–Clark subdivision surface
- Chaocipher
- Chat server
- Check Machin-like formulas
- Check input device is a terminal
- Check output device is a terminal
- Checkpoint synchronization
- Chernick's Carmichael numbers
- Cheryl's Birthday
- Chinese remainder theorem
- Chinese zodiac
- Chowla numbers
- Church Numerals
- Circular primes
- Closures/Value capture
- Color of a screen pixel
- Color quantization
- Color wheel
- Colour bars/Display
- Colour pinstripe/Display
- Colour pinstripe/Printer
- Combinations and permutations
- Commatizing numbers
- Compare sorting algorithms' performance
- Compiler/AST interpreter
- Compiler/code generator
- Compiler/lexical analyzer
- Compiler/syntax analyzer
- Compiler/virtual machine interpreter
- Continued fraction/Arithmetic/Construct from rational number
- Convex hull
- Copy stdin to stdout
- Count the coins
- Create an object at a given address
- Cuban primes
- Currency
- Currying
- Cut a rectangle
- Cyclotomic Polynomial
D
- DNS query
- Date manipulation
- De Bruijn sequences
- Death Star
- Deconvolution/2D+
- Deepcopy
- Deming's Funnel
- 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 squeezable
- Determine if only one instance is running
- Determine if two triangles overlap
- Dice game probabilities
- Dijkstra's algorithm
- Dinesman's multiple-dwelling problem
- Dining philosophers
- Discordian date
- Display a linear combination
- Distributed programming
- Dragon curve
- Draw a cuboid
- Draw a pixel
- Draw a rotating cube
- Draw a sphere
E
- EKG sequence convergence
- Eban numbers
- Echo server
- Eertree
- Egyptian division
- Egyptian fractions
- Elementary cellular automaton
- Elementary cellular automaton/Infinite length
- Elementary cellular automaton/Random Number Generator
- Elliptic curve arithmetic
- Empty directory
- Entropy/Narcissist
- Euler's identity
- Events
- Exceptions
- Exceptions/Catch an exception thrown in a nested call
- Executable library
- Execute SNUSP
- Execute a Markov algorithm
F
- FASTA format
- FTP
- Faces from a mesh
- Factorial base numbers indexing permutations of a collection
- Factorions
- Fairshare between two and more
- Farey sequence
- Faulhaber's formula
- Faulhaber's triangle
- Fermat numbers
- Fibonacci word
- Fibonacci word/fractal
- File size distribution
- Find common directory path
- Find duplicate files
- Find palindromic numbers in both binary and ternary bases
- Find the intersection of a line with a plane
- First-class functions
- 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
- Fixed length records
- Floyd-Warshall algorithm
- Fork
- Formal power series
- Four is magic
- Four is the number of letters in the ...
- Fractal tree
- Fraction reduction
- Function frequency
- Function prototype
- Functional coverage tree
- Fusc sequence
G
H
I
- ISBN13 check digit
- Idiomatically determine all the characters that can be used for symbols
- Idiomatically determine all the lowercase and uppercase letters
- Image convolution
- Image noise
- Imaginary base numbers
- Increasing gaps between consecutive Niven numbers
- Index finite lists of positive integers
- Inheritance/Multiple
- Intersecting Number Wheels
- Introspection
- Inverted index
- Iterated digits squaring
K
L
- LZW compression
- Lah numbers
- Largest number divisible by its digits
- Last letter-first letter
- Latin Squares in reduced form
- Law of cosines - triples
- Levenshtein distance
- Levenshtein distance/Alignment
- List rooted trees
- Long primes
- Long year?
- Longest Common Substring
- Longest increasing subsequence
- Longest string challenge
- Loops/Wrong ranges
- Loops/with multiple ranges
- Lucky and even lucky numbers
M
- MAC Vendor Lookup
- MD4
- MD5/Implementation
- Machine code
- Magic 8-Ball
- Magic squares of doubly even order
- Magic squares of singly even order
- Main step of GOST 28147-89
- Make directory path
- Mastermind
- Matrix Digital Rain
- Mayan numerals
- Maze generation
- Maze solving
- McNuggets Problem
- Median filter
- Mertens function
- Metallic ratios
- Metaprogramming
- Metered concurrency
- Metronome
- Mian-Chowla sequence
- Mind boggling card trick
- Minesweeper game
- Minimal steps down to 1
- Modular arithmetic
- Modular exponentiation
- Modular inverse
- Monads/List monad
- Monads/Maybe monad
- Monads/Writer monad
- Morse code
- Mouse position
- Move-to-front algorithm
- Multiplicative order
- Multisplit
- Munching squares
- Mutex
N
O
P
- P-value correction
- Palindrome dates
- Palindromic gapful numbers
- Paraffins
- Parallel Brute Force
- Parametrized SQL statement
- Parse an IP Address
- Parsing/RPN to infix conversion
- Partial function application
- Partition an integer X into N primes
- Pascal's triangle/Puzzle
- Password generator
- Pattern matching
- Peaceful chess queen armies
- Peano curve
- Pell's equation
- Penney's game
- Pentagram
- Percolation/Bond percolation
- Percolation/Mean cluster density
- Perfect shuffle
- Perfect totient numbers
- Perlin noise
- Permutation test
- Permutations/Derangements
- Permutations/Rank of a permutation
- Permutations by swapping
- Pierpont primes
- Pig the dice game
- Pig the dice game/Player
- Pinstripe/Display
- Pinstripe/Printer
- Plasma effect
- Play recorded sounds
- Playfair cipher
- Plot coordinate pairs
- Poker hand analyser
- Polyspiral
- Power set
- Pragmatic directives
- Primality by Wilson's theorem
- Primes - allocate descendants to their ancestors
- Pythagoras tree
- Pythagorean quadruples
R
- RCRPG
- RIPEMD-160
- RPG Attributes Generator
- RSA code
- Ramanujan's constant
- Ramer-Douglas-Peucker line simplification
- Range consolidation
- Ranking methods
- Rare numbers
- Read a file character by character/UTF8
- Recaman's sequence
- Record sound
- Reflection/Get source
- Reflection/List methods
- Regular expressions
- Rendezvous
- Rep-string
- Repeat
- Resistor mesh
- Respond to an unknown method call
- Retrieve and search chat history
- 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 popularity
- Runtime evaluation
- Runtime evaluation/In an environment
S
- S-Expressions
- SOAP
- SQL-based authentication
- Safe addition
- Safe primes and unsafe primes
- Sailors, coconuts and a monkey problem
- Same Fringe
- Scope/Function names and labels
- Scope modifiers
- Self-describing numbers
- Self-referential sequence
- Semiprime
- Send an unknown method call
- Sequence: nth number with exactly n divisors
- Sequence: smallest number greater than previous term with exactly n divisors
- Sequence: smallest number with exactly n divisors
- Set
- Set consolidation
- Set of real numbers
- Set puzzle
- Sexy primes
- Shortest common supersequence
- Sierpinski pentagon
- Sierpinski triangle/Graphical
- Simple database
- Simple windowed application
- Simulate input/Keyboard
- Simulate input/Mouse
- Singleton
- Smarandache prime-digital sequence
- Sockets
- 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 a list of object identifiers
- Sort numbers lexicographically
- Sorting algorithms/Cocktail sort with shifting bounds
- Sorting algorithms/Patience sort
- Sorting algorithms/Permutation sort
- Sorting algorithms/Strand sort
- Soundex
- Sparkline in unicode
- Speech synthesis
- Spelling of ordinal numbers
- Spinning rod animation/Text
- Square-free integers
- Square but not cube
- Stable marriage problem
- Start from a main routine
- State name puzzle
- Stirling numbers of the first kind
- Stirling numbers of the second kind
- Straddling checkerboard
- Strong and weak primes
- Successive prime differences
- Suffixation of decimal numbers
- Sum and Product Puzzle
- Sunflower fractal
- Super-d numbers
- Superellipse
- Superpermutation minimisation
- Synchronous concurrency
T
- Table creation/Postal addresses
- Take notes on the command line
- Tarjan
- Taxicab numbers
- Teacup rim text
- Terminal control/Cursor movement
- Terminal control/Dimensions
- Terminal control/Display an extended character
- Terminal control/Hiding the cursor
- Terminal control/Inverse video
- Terminal control/Positional read
- Terminal control/Preserve screen
- Terminal control/Ringing the terminal bell
- Terminal control/Unicode output
- Textonyms
- The ISAAC Cipher
- The Name Game
- Thiele's interpolation formula
- Tonelli-Shanks algorithm
- Topic variable
- Total circles area
- Totient function
- Truth table
- Twelve statements
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 Fortran (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
- Card shuffles
- Chebyshev coefficients
- Checksumcolor
- Chemical Calculator
- Chess player
- Cipolla's algorithm
- Code segment unload
- Combinations with repetitions/Square Digit Chain
- Compiler/Verifying Syntax
- Continued fraction/Arithmetic/G(matrix NG, Contined Fraction N)
- Continued fraction/Arithmetic/G(matrix NG, Contined Fraction N1, Contined Fraction N2)
- Create DWM statusbar
- Create an object/Native demonstration
- Curve that touches three points
- Cycle detection
D
E
F
G
H
I
L
M
- Magnanimous numbers
- Make a backup file
- Markov chain text generator
- Mayan calendar
- Mersenne primes
- Minimum positive multiple in base 10 using only 0 and 1
- Modulinos
- Montgomery reduction
- Morpion solitaire
- Most frequent k chars distance
- Multidimensional Newton-Raphson method
- Multiline shebang
- Musical scale
- Möbius function
N
P
- Parse EBNF
- Parse command-line arguments
- Particle Swarm Optimization
- Penrose tiling
- Pentomino tiling
- Perceptron
- Permutations with repetitions
- Permutations with some identical elements
- Pisano period
- Polynomial synthetic division
- Powerful numbers
- Print debugging statement
- Print itself
- Process SMIL directives in XML data
R
- Railway circuit
- Ramsey's theorem
- Random Latin Squares
- Raster bars
- Readline interface
- Recursive descent parser generator
- Remote agent/Agent interface
- Remote agent/Agent logic
- Remote agent/Simulation
- Resistance Calculator
- Resistance Network Calculator
- Reverse the gender of a string
- Robots
- Rosetta Code/List authors of task descriptions
- Rosetta Code/Rank languages by number of users
- Rosetta Code/Run examples
- Rosetta Code/Tasks without examples
- Run as a daemon or service
S
- Safe mode
- Sattolo cycle
- Self-hosting compiler
- Separate the house number from the street name
- Sierpinski arrowhead curve
- Sierpinski curve
- Sierpinski square curve
- Simulated annealing
- Sine wave
- Snake
- Snake And Ladder
- Solve a Rubik's Cube
- Solve triangle solitare puzzle
- Solving coin problems
- Sorting algorithms/Cycle sort
- Sorting algorithms/Tree sort on a linked list
- Spoof game
- Starting a web browser
- Subset sum problem
- Suffix tree
- Sum data type
T
- Table creation
- Tamagotchi emulator
- Terminal control/Restricted width positional input/No wrapping
- Terminal control/Restricted width positional input/With wrapping
- Tetris
- Text between
- Text to HTML
- Time-based One-time Password Algorithm
- Topological sort/Extracted top item
- Transportation problem
- Tree datastructures
- Type detection
U
W
Requiring Attention[edit]
Examples[edit]
These tasks have implementations in Fortran, 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.
No pages found.
Other pages[edit]
These are other pages related to Fortran which require attention; with your knowledge and assistance, we can improve the quality of the site's content.
G
Not Considered[edit]
These tasks are not generally counted toward "unimplemented", as somebody, somewhere, decided that Fortran was inappropriate for these tasks, or implementations of them would be unenlightening. Feel free to try your hand at them anyway.
End of List[edit]
Again, feel free to try your hand at any of the tasks listed on this page.
