Infix notation: Difference between revisions

Content deleted Content added
Gesslein (talk | contribs)
m Undid revision 231010603 by 59.182.234.189 (talk)
-These are explained in the article.
Line 3:
}}'''Infix notation''' is the common arithmetic and logical formula notation, in which [[operator]]s are written [[infix]]-style between the [[operand]]s they act on (e.g. 2 '''+''' 2). It is not as simple to [[Parsing|parse]] by computers as [[prefix notation]] ( e.g. '''+''' 2 2 ) or [[postfix notation]] ( e.g. 2 2 '''+''' ), but many [[programming language]]s use it due to its familiarity.
 
In infix notation, unlike in prefix or postfix notations, [[Bracket#Parentheses_.28_.29|parentheses]] surrounding groups of operands and operators are necessary to indicate the intended order in which operations are to be performed. In the absence of parentheses, certain precedence rules determine the order of operations. These are explained in the [[order of operations]]. article.
 
==See also==