Welcome to TheAlgorithms/Fortran!
Welcome to Fortran! This repository is meant to be referenced and used by learners worldwide, and we aspire to maintain the highest possible quality of the code presented here! If you have any questions or concerns about this guide, please feel free to state them clearly in an issue or ask the community in Discord.
An Algorithm is one or more functions that:
- take one or more inputs,
- perform some internal calculations or data manipulations,
- return one or more outputs,
- have minimal side effects (Examples of side effects:
print
,read
).
Being one of our contributors, you agree and confirm that:
- Your work will be distributed under MIT License once your pull request is merged.
- Your work meets the standards of this guideline.
We appreciate any contribution, from fixing a grammar mistake in a comment to implementing complex algorithms. Please check the directory and issues for an existing (or declined) implementation of your algorithm and relevant discussions.
New implementations are welcome! This includes new solutions for a problem, different representations for a data structure, and algorithm design with different complexity or features.
Improving documentation and comments and adding tests is also highly welcome.
Identical implementations are not allowed.
The environment that I am using is GNU Fortran (Ubuntu 9.4.0-1ubuntu1~20.04.1) 9.4.0
, a quite stable version of Fortran. Lower versions of Fortran are also acceptable.
- The unit of implementation we expect is a Fortran Module. Although the main goals of this repository are educational, the module form mirrors a real-world scenario and makes it easy to use the code from this repository in other projects.
- The first line must contain the canonical title of the module prefixed by double hashes (
## Title Of The Module
). This title is used in this repository's automation for populating the Directory. - The module should be thoroughly documented with doc comments. Follow the Fortran documentation style.
- The file begins with the module-level documentation with the general description and explanation of the algorithm/data-structure:
- Any restrictions of the implementation and any constraints for the input data.
- An overview of the use cases.
- Recommendations for when to use or avoid using it.
- Comparison with the alternatives.
- Links to source materials and further reading.
- Use intuitive and descriptive names for objects, functions, and variables.
- Return all calculation results instead of printing or plotting them.
- Avoid importing third-party libraries. Only use those for complicated algorithms and only if the alternatives of relying on the standard library or including a short amount of the appropriately-licensed external code are not feasible.
We want your work to be readable by others; therefore, we encourage you to follow the official Fortran Coding Style.
- Help your readers by using descriptive names that eliminate the need for redundant comments.
- Avoid single-letter variable names, unless it has a Minimal lifespan. If your variable comes from a mathematical context or no confusion is possible with another variable, you may use single-letter variables. Generally, single-letter variables stop being OK if there are more than just a couple of them in scope. Some examples:
- Prefer
index
oridx
toi
for loops. - Prefer
src
anddst
toa
andb
. - Prefer
remainder
tor
andprefix
top
.
- Prefer
- Expand acronyms. Prefer
greatest_common_divisor()
togcd()
, as the former is easier to understand than the latter, especially for non-native English speakers.
!> My Algorithm
!!
!! Description, explanation, recommendations, sources, links.
!! This simple program adds two numbers
program addNumbers
implicit none
!! Type declarations
real :: a, b, result
!! Executable statements
a = 12.0
b = 15.0
result = a + b
print *, 'The total is ', result
end program addNumbers
- Make sure the code compiles before submitting.
- Look up the name of your algorithm in other active repositories of TheAlgorithms, like TheAlgorithms/Python. By reusing the same name, your implementation will be appropriately grouped alongside other implementations on the project's website.
- Please help us keep our issue list small by adding fixes: Add the number of the issue you solved — even if only partially — to the commit message of your pull request.
- Use snake_case (words separated with an underscore
_
) for the filename. - Try to fit your work into the existing directory structure as much as possible. Please open an issue first if you want to create a new subdirectory.
- Writing documentation, be concise, and check your spelling and grammar.
- Add a corresponding explanation to Algorithms-Explanation (optional but recommended).
- Implementing the modules is not just enough. We strongly recommend you make an example usage and a test file of your code, and put it under the "examples" and "tests" directories, under the category of your algorithm.
- Most importantly, be consistent in the use of these guidelines.
Happy coding!
Authors: @SatinWukerORIG