Reports:Tasks not implemented in C sharp
From Rosetta Code
Awareness
If C sharp is a language you like, or are interested in, please inform your fellow members of the C sharp community; this page can't be emptied without your and their participation.
If C sharp is a language you like, or are interested in, please inform your fellow members of the C sharp community; this page can't be emptied without your and their participation.
Contents
Not implemented[edit]
These are currently not implemented in C sharp. Please implement some if you can. If any tasks are not possible or too complex in C sharp, they should not be on this list. To mark a task as such, add {{omit from|C sharp}}, preserving the capitalization of the language, to that task. It will appear below under the "Not Considered" section.
A
B
C
- Calkin-Wilf sequence
- Call a foreign-language function
- Canny edge detector
- Carmichael 3 strong pseudoprimes
- Catmull–Clark subdivision surface
- Check Machin-like formulas
- Check input device is a terminal
- Checkpoint synchronization
- Chernick's Carmichael numbers
- Circular primes
- Cistercian numerals
- Color quantization
- Color wheel
- Colour bars/Display
- Colour pinstripe/Display
- Colour pinstripe/Printer
- Combinations and permutations
- Compare sorting algorithms' performance
- Compiler/AST interpreter
- Compiler/code generator
- Compiler/syntax analyzer
- Compiler/virtual machine interpreter
- Conjugate transpose
- Create an object at a given address
- Cut a rectangle
D
E
- EKG sequence convergence
- Elementary cellular automaton/Infinite length
- Elementary cellular automaton/Random Number Generator
- Elliptic Curve Digital Signature Algorithm
- Elliptic curve arithmetic
- Entropy/Narcissist
- Executable library
- Execute SNUSP
- Execute a Markov algorithm
- Exponentiation with infix operators in (or operating on) the base
- Extensible prime generator
- Extreme floating point values
F
- FTP
- Faces from a mesh
- Factorial base numbers indexing permutations of a collection
- Factorions
- Fairshare between two and more
- Fermat numbers
- Fibonacci word/fractal
- File extension is in extensions list
- File size distribution
- Find duplicate files
- First class environments
- Fixed length records
- Flipping bits game
- Formal power series
- Four is magic
- Four is the number of letters in the ...
- Fractal tree
- Fractran
- French Republican calendar
- Function frequency
- Functional coverage tree
G
I
K
L
M
- Machine code
- Magic squares of odd order
- Magic squares of singly even order
- Main step of GOST 28147-89
- Mastermind
- Matrix digital rain
- Mayan numerals
- Maze solving
- Median filter
- Memory layout of a data structure
- Merge and aggregate datasets
- Mertens function
- Metronome
- Mind boggling card trick
- Minkowski question-mark function
- Modified random distribution
- Monads/List monad
- Monads/Writer monad
- Musical scale
- Mutex
N
O
P
- P-Adic numbers, basic
- P-Adic square roots
- Padovan n-step number sequences
- Padovan sequence
- Palindromic gapful numbers
- Pancake numbers
- Paraffins
- Parse an IP Address
- Partition function P
- Peano curve
- Pentagram
- Percolation/Bond percolation
- Percolation/Mean cluster density
- Percolation/Mean run density
- Percolation/Site percolation
- Perfect totient numbers
- Perlin noise
- Permutations/Rank of a permutation
- Permutations by swapping
- Pig the dice game/Player
- Pinstripe/Printer
- Pisano period
- Plasma effect
- Playfair cipher
- Plot coordinate pairs
- Pragmatic directives
- Primes - allocate descendants to their ancestors
- Primorial numbers
- Pseudo-random numbers/Combined recursive generator MRG32k3a
- Pseudo-random numbers/PCG32
- Pseudo-random numbers/Xorshift star
- Pythagoras tree
R
- RCRPG
- Ramanujan's constant
- Random sentence from book
- Rate counter
- Ray-casting algorithm
- Read a configuration file
- Record sound
- Reflection/Get source
- Rendezvous
- Rep-string
- Retrieve and search chat history
- Rosetta Code/Find bare lang tags
- Rosetta Code/Fix code tags
- Rosetta Code/Rank languages by number of users
- Runtime evaluation
- Runtime evaluation/In an environment
S
- SHA-256 Merkle tree
- SOAP
- Scope/Function names and labels
- Self-describing numbers
- 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
- Sequence of primorial primes
- Sexy primes
- Shortest common supersequence
- Sierpinski pentagon
- Sierpinski triangle/Graphical
- Simulate input/Keyboard
- Simulate input/Mouse
- Sleeping Beauty problem
- Smarandache prime-digital sequence
- Solve the no connection puzzle
- Sort an outline at every level
- Sorting algorithms/Bead sort
- Sorting algorithms/Cocktail sort with shifting bounds
- Sorting algorithms/Patience sort
- Sorting algorithms/Strand sort
- Sparkline in unicode
- Special characters
- Special variables
- Spelling of ordinal numbers
- Spinning rod animation/Text
- Square-free integers
- Square Form Factorization
- State name puzzle
- Stirling numbers of the first kind
- Stirling numbers of the second kind
- Strassen's algorithm
- String comparison
- Suffixation of decimal numbers
- Summarize and say sequence
- Sunflower fractal
- Superellipse
- Superpermutation minimisation
T
- Table creation/Postal addresses
- Tau function
- Tau number
- Teacup rim text
- Terminal control/Inverse video
- Terminal control/Positional read
- Terminal control/Preserve screen
- Terminal control/Unicode output
- Text processing/1
- Textonyms
- Thiele's interpolation formula
- Topic variable
- Topswops
- Total circles area
- Trabb Pardo–Knuth algorithm
- Tree datastructures
- Tree from nesting levels
U
V
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 C sharp (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
- Change e letters to i in words
- Changeable words
- Checksumcolor
- Chess player
- Code segment unload
- Combinations with repetitions/Square digit chain
- Common list elements
- Common sorted list
- Compiler/Simple file inclusion pre processor
- Compiler/Verifying syntax
- Concatenate two primes is also prime
- Continued fraction/Arithmetic/G(matrix ng, continued fraction n)
- Continued fraction/Arithmetic/G(matrix ng, continued fraction n1, continued fraction n2)
- Coprime triplets
- Coprimes
- Count how many vowels and consonants occur in a string
- Count the coins/0-1
- Cousin primes
- Create an object/Native demonstration
- Cubic Special Primes
- Curve that touches three points
- Cyclops numbers
D
F
- Fibonacci heap
- Find URI in text
- Find first and last set bit of a long integer
- Find first missing positive
- Find if a point is within a triangle
- Find prime n for that reversed n is also prime
- Find prime numbers of the form n*n*n+2
- Find words which contains all the vowels
- Find words which contains more than 3 e vowels
- Find words which contains most consonants
- Find words which first and last three letters are equals
- Find words with alternating vowels and consonants
- Finite state machine
G
I
L
M
N
- NYSIIS
- Names to numbers
- Native shebang
- Next special primes
- Nice primes
- Numbers divisible by their individual digits, but not by the product of their digits.
- Numbers in base-16 representation that cannot be written with decimal digits
- Numbers in base 10 that are palindromic in bases 2, 4, and 16
- Numbers n in which number 1 occur twice
- Numbers which binary and ternary digit sum are prime
- Numbers which count of divisors is prime
- Numbers with equal rises and falls
- Numbers with same digit set in base 10 and base 16
- Numeric separator syntax
- Numerical integration/Adaptive Simpson's method
P
- Palindromic primes
- Palindromic primes in base 16
- Parse EBNF
- Parse command-line arguments
- Penrose tiling
- Perceptron
- Permutations with repetitions
- Permutations with some identical elements
- Piprimes
- Powerful numbers
- Price list behind API
- Prime numbers p which sum of prime numbers less or equal to p is prime
- Prime numbers which contain 123
- Prime triplets
- Prime words
- Primes which contain only one odd number
- Primes which sum of digits is 25
- Primes whose first and last number is 3
- Print debugging statement
- Print itself
- Process SMIL directives in XML data
- Product of divisors
- Proof
- Pseudo-random numbers/Splitmix64
- Pseudorandom number generator image
R
- Railway circuit
- Ramsey's theorem
- Range modifications
- Raster bars
- 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/Run examples
- Rosetta Code/Tasks without examples
- Run as a daemon or service
S
- Safe mode
- Selective file copy
- Separate the house number from the street name
- Shift list elements to left by 3
- Sierpinski arrowhead curve
- Sierpinski curve
- Sierpinski square curve
- Simple turtle graphics
- Simulated annealing
- Sine wave
- Smallest enclosing circle problem
- Smallest numbers
- Smallest power of 6 whose decimal expansion contains n
- Smallest square that begins with n
- Snake
- Solve a Rubik's Cube
- Solve triangle solitare puzzle
- Solving coin problems
- Sorting algorithms/Cycle sort
- Sorting algorithms/Tree sort on a linked list
- Special factorials
- Spoof game
- Starting a web browser
- Strange numbers
- Strange plus numbers
- Substring primes
- Sum data type
- Sum of divisors
- Sum of elements below main diagonal of matrix
- Sum of the digits of n is substring of n
- Summarize primes
- Sylvester's sequence
T
U
W
Requiring Attention[edit]
Examples[edit]
These tasks have implementations in C sharp, 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 C sharp which require attention; with your knowledge and assistance, we can improve the quality of the site's content.
No pages found.
Not Considered[edit]
These tasks are not generally counted toward "unimplemented", as somebody, somewhere, decided that C sharp was inappropriate for these tasks, or implementations of them would be unenlightening. Feel free to try your hand at them anyway.
C
I
J
S
End of List[edit]
Again, feel free to try your hand at any of the tasks listed on this page.
