# Operators (C# Programming Guide)

In C#, an *operator* is a program element that is applied to one or more *operands* in an expression or statement. Operators that take one operand, such as the increment operator (`++`

) or `new`

, are referred to as *unary* operators. Operators that take two operands, such as arithmetic operators (`+`

,`-`

,`*`

,`/`

), are referred to as *binary* operators. One operator, the conditional operator (`?:`

), takes three operands and is the sole ternary operator in C#.

The following C# statement contains a single unary operator and a single operand. The increment operator, `++`

, modifies the value of the operand `y`

.

```
y++;
```

The following C# statement contains two binary operators, each with two operands. The assignment operator, `=`

, has the integer variable `y`

and the expression `2 + 3`

as operands. The expression `2 + 3`

itself consists of the addition operator and two operands, `2`

and `3`

.

```
y = 2 + 3;
```

An operand can be a valid expression that is composed of any length of code, and it can comprise any number of sub expressions. In an expression that contains multiple operators, the order in which the operators are applied is determined by *operator precedence*, *associativity*, and parentheses.

## Operator precedence

Each operator has a defined precedence. In an expression that contains multiple operators that have different precedence levels, the precedence of the operators determines the order in which the operators are evaluated. For example, the following statement assigns 3 to `n1`

:

```
n1 = 11 - 2 * 4;
```

The multiplication is executed first because multiplication takes precedence over subtraction.

For the complete list of C# operators ordered by precedence level, see C# operators.

## Associativity

When two or more operators that have the same precedence are present in an expression, they are evaluated based on associativity. Left-associative operators are evaluated in order from left to right. For example, `x * y / z`

is evaluated as `(x * y) / z`

. Right-associative operators are evaluated in order from right to left. For example, the assignment operator is right associative. If it were not, the following code would result in an error.

```
int a, b, c;
c = 1;
// The following two lines are equivalent.
a = b = c;
a = (b = c);
// The following line, which forces left associativity, causes an error.
//(a = b) = c;
```

As another example the ternary operator (?:) is right associative. Most binary operators are left associative.

Whether the operators in an expression are left associative or right associative, the operands of each expression are evaluated first, from left to right. The following examples illustrate the order of evaluation of operators and operands.

Statement | Order of evaluation |
---|---|

`a = b` |
a, b, = |

`a = b + c` |
a, b, c, +, = |

`a = b + c * d` |
a, b, c, d, *, +, = |

`a = b * c + d` |
a, b, c, *, d, +, = |

`a = b - c + d` |
a, b, c, -, d, +, = |

`a += b -= c` |
a, b, c, -=, += |

## Adding parentheses

You can change the order imposed by operator precedence and associativity by using parentheses. For example, `2 + 3 * 2`

ordinarily evaluates to 8, because multiplicative operators take precedence over additive operators. However, if you write the expression as `(2 + 3) * 2`

, the addition is evaluated before the multiplication, and the result is 10. The following examples illustrate the order of evaluation in parenthesized expressions. As in previous examples, the operands are evaluated before the operator is applied.

Statement | Order of evaluation |
---|---|

`a = (b + c) * d` |
a, b, c, +, d, *, = |

`a = b - (c + d)` |
a, b, c, d, +, -, = |

`a = (b + c) * (d - e)` |
a, b, c, +, d, e, -, *, = |

## Operator overloading

You can define the behavior of certain operators for custom classes and structs. This process is referred to as *operator overloading*. For more information, see Overloadable operators and the operator keyword article.

## See also

## Feedback

Send feedback about:

Loading feedback...