# Reports:Tasks not implemented in Fortran

**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.

## 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.

### A

- AVL tree
- Active Directory/Connect
- Active Directory/Search for a user
- Active object
- Almost prime
- Amb
- Anagrams/Deranged anagrams
- Animation
- Apply a digital filter (direct form II transposed)
- Archimedean spiral
- Arithmetic-geometric mean/Calculate Pi
- Arithmetic evaluation
- Assertions
- Associative array/Creation
- Associative array/Iteration
- Atomic updates
- Average loop length

### B

### C

- Canny edge detector
- Cartesian product of two or more lists
- Casting out nines
- Catalan numbers/Pascal's triangle
- Catmull–Clark subdivision surface
- Chaos game
- Chat server
- Check Machin-like formulas
- Checkpoint synchronization
- Chinese remainder theorem
- Chinese zodiac
- Closures/Value capture
- Color of a screen pixel
- Color quantization
- 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
- Count the coins
- Create an object at a given address
- Currying
- Cut a rectangle

### D

### E

### F

- FASTA format
- FTP
- Farey sequence
- Fibonacci word
- Fibonacci word/fractal
- Find common directory path
- Find palindromic numbers in both binary and ternary bases
- Find the intersection of a line with a plane
- Find the intersection of two lines
- First-class functions
- First class environments
- Floyd-Warshall algorithm
- Fork
- Formal power series
- Fractal tree
- Function frequency
- Function prototype

### G

### H

### I

### K

### L

### M

- MAC Vendor Lookup
- MD4
- MD5/Implementation
- Machine code
- Magic squares of doubly even order
- Magic squares of singly even order
- Main step of GOST 28147-89
- Make directory path
- Maze generation
- Maze solving
- Median filter
- Metaprogramming
- Metered concurrency
- Metronome
- Minesweeper game
- Modular exponentiation
- Modular inverse
- Morse code
- Mouse position
- Move-to-front algorithm
- Multiplicative order
- Multisplit
- Munchausen numbers
- Munching squares

### N

### O

### P

- 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
- Penney's game
- Pentagram
- Percolation/Bond percolation
- Percolation/Mean cluster density
- Perfect shuffle
- Permutation test
- Permutations/Derangements
- Permutations/Rank of a permutation
- Permutations by swapping
- Pig the dice game
- Pig the dice game/Player
- Pinstripe/Display
- Pinstripe/Printer
- Plasma effect
- Play recorded sounds
- Plot coordinate pairs
- Poker hand analyser
- Polyspiral
- Power set
- Pragmatic directives
- Primes - allocate descendants to their ancestors
- Pythagoras tree
- Pythagorean quadruples

### R

- RCRPG
- RIPEMD-160
- RSA code
- Ramer-Douglas-Peucker line simplification
- Ranking methods
- Record sound
- Reflection/Get source
- Reflection/List methods
- Regular expressions
- Rendezvous
- Rep-string
- 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
- 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
- Set
- Set consolidation
- Set of real numbers
- Set puzzle
- Sierpinski pentagon
- Sierpinski triangle/Graphical
- Simple database
- Simple windowed application
- Simulate input/Keyboard
- Simulate input/Mouse
- Singleton
- 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
- Sorting algorithms/Permutation sort
- Sorting algorithms/Strand sort
- Soundex
- Sparkline in unicode
- Speech synthesis
- Stable marriage problem
- Start from a main routine
- State name puzzle
- Stern-Brocot sequence
- Straddling checkerboard
- Sum and Product Puzzle
- Superellipse
- Synchronous concurrency

### T

- Table creation/Postal addresses
- Take notes on the command line
- Taxicab numbers
- 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
- Thiele's interpolation formula
- Topic variable
- Total circles area
- Truth table
- Twelve statements

### U

### V

### W

### Draft tasks without implementation[edit]

These tasks as 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

- Card shuffles
- Chebyshev coefficients
- Check input device is a terminal
- Check output device is a terminal
- Chess player
- Chess player/Move generation
- Chess player/Program options and user interface
- Chess player/Search and evaluation
- Cipolla's algorithm
- Code segment unload
- Color wheel
- Combinations with repetitions/Square Digit Chain
- Continued fraction/Arithmetic/G(matrix NG, Contined Fraction N)
- Continued fraction/Arithmetic/G(matrix NG, Contined Fraction N1, Contined Fraction N2)
- Convex hull
- Create an object/Native demonstration
- Currency
- Cycle detection

### D

### E

### F

### G

### H

### I

- I.Q. Puzzle
- IPC via named pipe
- IRC gateway
- Idiomatically determine all the characters that can be used for symbols
- Idiomatically determine all the lowercase and uppercase letters
- Imaginary base numbers
- Implicit type conversion
- Index finite lists of positive integers
- Input/Output for Lines of Text
- Integer roots

### L

### M

### O

### P

### R

- Railway circuit
- Ramsey's theorem
- Read a file character by character/UTF8
- Readline interface
- Recursive descent parser generator
- Reflection/List methods
- Remote agent/Agent interface
- Remote agent/Agent logic
- Remote agent/Simulation
- Repeat
- Reverse the gender of a string
- Robots
- Rosetta Code/List authors of task descriptions
- Rosetta Code/Run examples
- Rosetta Code/Tasks sorted by average lines of code
- Rosetta Code/Tasks without examples
- Run as a daemon or service

### S

- Sattolo cycle
- Self-hosting compiler
- Separate the house number from the street name
- Shortest common supersequence
- Simulated annealing
- Snake
- Snake And Ladder
- Solve a Rubik's Cube
- Solving coin problems
- Sorting algorithms/Cycle sort
- Sorting algorithms/Patience sort
- Sorting algorithms/Tree sort on a linked list
- Spelling of ordinal numbers
- Starting a web browser
- Subset sum problem
- Suffix tree
- Superpermutation minimisation

### T

- Table creation
- Tamagotchi emulator
- Tarjan
- Terminal control/Restricted width positional input/No wrapping
- Terminal control/Restricted width positional input/With wrapping
- Tetris
- Text to HTML
- Time-based One-time Password Algorithm
- Tonelli-Shanks algorithm
- Topological sort/Extracted top item
- Transportation problem
- Two Sum
- 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.

### 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.