Category:Programming Tasks: Difference between revisions
No edit summary |
|||
(21 intermediate revisions by 16 users not shown) | |||
Line 1:
Programming tasks are problems that may be solved through programming.
When such a task is defined, Rosetta Code users are encouraged to solve them using as many different languages as they know.
The end goal is to demonstrate how the same task is accomplished in different languages.
These are the Programming Tasks that have been defined and solved.
Feel free to add solutions in languages not already included.
The [[:Category:Simple]] is a small subset with only "really simple" tasks,
like "Hello World", and demonstrations of basic language-features.
The [[:Category:Draft Programming Tasks]] is a list of tasks, some of which are just awaiting more implementations before they can be promoted to tasks.
Others may well have problems, (check their discussion and history pages).
The [[:Category:Solutions by Programming Task]] groups tasks based on their theme (such as Mathematics or Text processing).
Read the [[Rosetta Code:Add a Task|guidelines]] on creating new tasks.
If you need help, check the [[:Category talk:Programming Tasks|discussion for this page]].
See also [[Help:Adding a new programming example]].
Jump: {{taskpage|1}} {{taskpage|A}} {{taskpage|B}} {{taskpage|C}} {{taskpage|D}} {{taskpage|E}} {{taskpage|F}} {{taskpage|G}} {{taskpage|H}} {{taskpage|I}} {{taskpage|J}} {{taskpage|K}} {{taskpage|L}} {{taskpage|M}} {{taskpage|N}} {{taskpage|O}} {{taskpage|P}} {{taskpage|Q}} {{taskpage|R}} {{taskpage|S}} {{taskpage|T}} {{taskpage|U}} {{taskpage|V}} {{taskpage|W}} {{taskpage|X}} {{taskpage|Y}} {{taskpage|Z}}
|
Latest revision as of 12:33, 23 November 2023
Programming tasks are problems that may be solved through programming. When such a task is defined, Rosetta Code users are encouraged to solve them using as many different languages as they know. The end goal is to demonstrate how the same task is accomplished in different languages.
These are the Programming Tasks that have been defined and solved. Feel free to add solutions in languages not already included.
The Category:Simple is a small subset with only "really simple" tasks, like "Hello World", and demonstrations of basic language-features.
The Category:Draft Programming Tasks is a list of tasks, some of which are just awaiting more implementations before they can be promoted to tasks. Others may well have problems, (check their discussion and history pages).
The Category:Solutions by Programming Task groups tasks based on their theme (such as Mathematics or Text processing).
Read the guidelines on creating new tasks. If you need help, check the discussion for this page.
See also Help:Adding a new programming example.
Pages in category "Programming Tasks"
The following 200 pages are in this category, out of 1,276 total.
(previous page) (next page)P
- Penta-power prime seeds
- Pentagram
- Pentomino tiling
- Percentage difference between images
- Percolation/Bond percolation
- Percolation/Mean cluster density
- Percolation/Mean run density
- Percolation/Site percolation
- Perfect numbers
- Perfect shuffle
- Perfect totient numbers
- Periodic table
- Peripheral drift illusion
- Perlin noise
- Permutation test
- Permutations
- Permutations by swapping
- Permutations/Derangements
- Permutations/Rank of a permutation
- Pernicious numbers
- Phrase reversals
- Pi
- Pick random element
- Pierpont primes
- Pig the dice game
- Pig the dice game/Player
- Pinstripe/Display
- Pinstripe/Printer
- Pisano period
- Plasma effect
- Play recorded sounds
- Playfair cipher
- Playing cards
- Plot coordinate pairs
- Pointers and references
- Poker hand analyser
- Polymorphic copy
- Polymorphism
- Polynomial long division
- Polynomial regression
- Polyspiral
- Population count
- Power set
- Pragmatic directives
- Price fraction
- Primality by trial division
- Primality by Wilson's theorem
- Prime conspiracy
- Prime decomposition
- Prime numbers whose neighboring pairs are tetraprimes
- Prime triangle
- Primes - allocate descendants to their ancestors
- Primes: n*2^m+1
- Primorial numbers
- Priority queue
- Probabilistic choice
- Problem of Apollonius
- Product of min and max prime factors
- Program name
- Program termination
- Proper divisors
- Pseudo-random numbers/Combined recursive generator MRG32k3a
- Pseudo-random numbers/Middle-square method
- Pseudo-random numbers/PCG32
- Pseudo-random numbers/Splitmix64
- Pseudo-random numbers/Xorshift star
- Pythagoras tree
- Pythagorean quadruples
- Pythagorean triples
Q
R
- Radical of an integer
- Ramanujan primes/twins
- Ramanujan's constant
- Ramer-Douglas-Peucker line simplification
- Random Latin squares
- Random number generator (device)
- Random number generator (included)
- Random numbers
- Random sentence from book
- Range consolidation
- Range expansion
- Range extraction
- Ranking methods
- Rare numbers
- Rate counter
- Ray-casting algorithm
- RCRPG
- Read a configuration file
- Read a file character by character/UTF8
- Read a file line by line
- Read a specific line from a file
- Read entire file
- Real constants and functions
- Recaman's sequence
- Record sound
- Reduced row echelon form
- Reflection/Get source
- Reflection/List methods
- Reflection/List properties
- Regular expressions
- Remove duplicate elements
- Remove lines from a file
- Rename a file
- Rendezvous
- Rep-string
- Repeat
- Repeat a string
- Repunit primes
- Resistor mesh
- Respond to an unknown method call
- Retrieve and search chat history
- Return multiple values
- Reverse a string
- Reverse words in a string
- Rhonda numbers
- Riordan numbers
- RIPEMD-160
- Rock-paper-scissors
- Roman numerals/Decode
- Roman numerals/Encode
- Roots of a function
- Roots of a quadratic function
- Roots of unity
- 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
- Rosetta Code/Rank languages by popularity
- Rot-13
- Round-robin tournament schedule
- RPG attributes generator
- RSA code
- Run-length encoding
- Runge-Kutta method
- Runtime evaluation
- Runtime evaluation/In an environment
- Ruth-Aaron numbers
S
- S-expressions
- Safe addition
- Safe primes and unsafe primes
- Sailors, coconuts and a monkey problem
- Same fringe
- Scope modifiers
- Scope/Function names and labels
- Sealed classes and methods
- Search a list
- Search a list of records
- Search in paragraph's text
- Secure temporary file
- SEDOLs
- Selectively replace multiple instances of a character within a string
- Self numbers
- Self-describing numbers
- Semiprime
- Semordnilap
- Send an unknown method call
- Send email
- Sequence of non-squares
- Sequence of primes by trial division
- Sequence of primorial primes
- 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
- Set right-adjacent bits
- Set, the card game
- Seven-sided dice from five-sided dice
- Sexy primes
- SHA-1
- SHA-256
- SHA-256 Merkle tree
- Shell one-liner
- Shoelace formula for polygonal area
- Short-circuit evaluation
- Shortest common supersequence
- Show ASCII table
- Show the epoch
- Sierpinski arrowhead curve
- Sierpinski carpet
- Sierpinski pentagon
- Sierpinski square curve
- Sierpinski triangle
- Sierpinski triangle/Graphical
- Sieve of Eratosthenes
- Sieve of Pritchard
- Simple database
- Simple turtle graphics
- Simple windowed application
- Simulate input/Keyboard