Category:C sharp: Difference between revisions
Content added Content deleted
m (Linkified) |
(Categorized according to Language Comparison Table.) |
||
| Line 5: | Line 5: | ||
==Citations== |
==Citations== |
||
*[[wp:C_sharp|Wikipedia:C#]] |
*[[wp:C_sharp|Wikipedia:C#]] |
||
{{language programming paradigm|Imperative}} |
|||
{{language programming paradigm|Object-oriented}} |
|||
{{language programming paradigm|Generic}} |
|||
{{language programming paradigm|Reflective}} |
|||
{{language typing|Strong}} |
|||
{{language typing|Safe}} |
|||
{{language typing|Unsafe}} |
|||
{{language type expression|Implicit}} |
|||
{{language type compatibility|Nominative}} |
|||
{{language type checking|Static}} |
|||
{{language garbage collection|Yes}} |
|||
Revision as of 09:42, 15 February 2009
This programming language may be used to instruct a computer to perform a task.
| See Also: |
|
|---|
C# is an object-oriented programming language developed by Microsoft as part of their .NET initiative, and later approved as a standard by ECMA and ISO. C# has a procedural, object-oriented syntax based on C++ that includes aspects of several other programming languages (most notably Delphi and Java) with a particular emphasis on simplification (fewer symbolic requirements than C++, fewer declarative requirements than Java).
Citations
Template:Language typing Template:Language typing Template:Language typing
Template:Language type compatibility Template:Language type checking Template:Language garbage collection
Subcategories
This category has the following 3 subcategories, out of 3 total.
@
- C sharp Implementations (3 P)
- C sharp User (137 P)
Pages in category "C sharp"
The following 200 pages are in this category, out of 986 total.
(previous page) (next page)A
- A* search algorithm
- A+B
- Abbreviations, automatic
- ABC problem
- ABC words
- Abstract type
- Abundant odd numbers
- Abundant, deficient and perfect number classifications
- Accumulator factory
- Ackermann function
- Active Directory/Connect
- Active object
- Add a variable to a class instance at runtime
- Addition chains
- Address of a variable
- AKS test for primes
- Algebraic data types
- Align columns
- Aliquot sequence classifications
- Almkvist-Giullera formula for pi
- Almost prime
- Amb
- Amicable pairs
- Anagrams
- Anagrams/Deranged anagrams
- Angle difference between two bearings
- Angles (geometric), normalization and conversion
- Animate a pendulum
- Animation
- Anonymous recursion
- Anti-primes
- Append a record to the end of a text file
- Apply a callback to an array
- Apply a digital filter (direct form II transposed)
- Approximate equality
- Arbitrary-precision integers (included)
- Archimedean spiral
- Arithmetic coding/As a generalized change of radix
- Arithmetic numbers
- Arithmetic-geometric mean
- Arithmetic-geometric mean/Calculate Pi
- Arithmetic/Complex
- Arithmetic/Integer
- Arithmetic/Rational
- Array concatenation
- Array length
- Arrays
- Ascending primes
- Assertions
- Associative array/Creation
- Associative array/Iteration
- Associative array/Merging
- Atomic updates
- Attractive numbers
- Average loop length
- Averages/Arithmetic mean
- Averages/Mean angle
- Averages/Mean time of day
- Averages/Median
- Averages/Mode
- Averages/Pythagorean means
- Averages/Root mean square
- Averages/Simple moving average
- AVL tree
B
- Babbage problem
- Bacon cipher
- Balanced brackets
- Balanced ternary
- Barnsley fern
- Base58Check encoding
- Base64 decode data
- Base64 encode data
- Bell numbers
- Bernoulli numbers
- Bernstein basis polynomials
- Best shuffle
- Bifid cipher
- Bilinear interpolation
- Bin given limits
- Binary digits
- Binary search
- Binary strings
- Bitcoin/address validation
- Bitmap
- Bitmap/Bresenham's line algorithm
- Bitmap/Flood fill
- Bitmap/Midpoint circle algorithm
- Bitmap/Read a PPM file
- Bitmap/Write a PPM file
- Bitwise IO
- Bitwise operations
- Blum integer
- Boolean values
- Box the compass
- Brace expansion
- Brazilian numbers
- Break OO privacy
- Brownian tree
- Bulls and cows
- Bulls and cows/Player
- Burrows–Wheeler transform
- Bézier curves/Intersections
C
- Caesar cipher
- Calculating the value of e
- Calendar
- Call a function
- Call a function in a shared library
- Call an object method
- Canonicalize CIDR
- Cantor set
- Card shuffles
- Cartesian product of two or more lists
- Case-sensitivity of identifiers
- Casting out nines
- Catalan numbers
- Catalan numbers/Pascal's triangle
- Catamorphism
- Chaocipher
- Chaos game
- Character codes
- Chat server
- Chebyshev coefficients
- Check output device is a terminal
- Check that file exists
- Checkpoint synchronization
- Chemical calculator
- Cheryl's birthday
- Chinese remainder theorem
- Chinese zodiac
- Cholesky decomposition
- Chowla numbers
- Church numerals
- Cipolla's algorithm
- Circles of given radius through two points
- Classes
- Closest-pair problem
- Closures/Value capture
- Collections
- Color of a screen pixel
- Color wheel
- Combinations
- Combinations and permutations
- Combinations with repetitions
- Comma quibbling
- Command-line arguments
- Commatizing numbers
- Comments
- Compare a list of strings
- Compare length of two strings
- Compile-time calculation
- Compiler/lexical analyzer
- Compound data type
- Concurrent computing
- Conditional structures
- Consecutive primes with ascending or descending differences
- Constrained genericity
- Constrained random points on a circle
- Continued fraction
- Continued fraction/Arithmetic/Construct from rational number
- Convert decimal number to rational
- Convert seconds to compound duration
- Convex hull
- Conway's Game of Life
- Copy a string
- Copy stdin to stdout
- Count in factors
- Count in octal
- Count occurrences of a substring
- Count the coins
- Cramer's rule
- CRC-32
- Create a file
- Create a two-dimensional array at runtime
- Create an HTML table
- CSV data manipulation
- CSV to HTML translation
- Cuban primes
- Cumulative standard deviation
- Currency
- Currying
- CUSIP
- Cut a rectangle
- Cycle detection
- Cyclotomic polynomial