Editing Pidgin code

{{short description|Mixture of several programming languages in the same program}}
{{More citations needed|date=March 2025}}
{{Notability|date=March 2025}}

In [[computer programming]], '''pidgin code''' is a mixture of several [[programming language]]s in the same program, or mathematical [[pseudocode]] that is a mixture of a programming language with [[natural language]] descriptions.<ref name="n549">{{cite book | title=DAT10603 Programming Principle | url=https://books.google.com/books?id=78dO3P_QjPgC | publisher=Center for Diploma Studies, Hannes Masandig |page=125}}</ref><ref name="l762">{{cite web | title=Pseudocode | website=CodeDocs | date=2021-06-18 | url=https://codedocs.org/what-is/pseudocode | access-date=2025-03-01}}</ref> Hence the name: the mixture is a programming language analogous to a [[pidgin]] in [[natural language]]s.

==Examples==
In [[numerical computation]], mathematical style pseudocode is sometimes called pidgin code, for example ''pidgin [[ALGOL]]'' (the origin of the concept), ''pidgin [[Fortran]]'', ''pidgin [[BASIC]]'', ''pidgin [[Pascal (programming language) | Pascal]]'', and ''pidgin [[C (programming language) | C]]''. It is a compact and often informal notation that blends [[syntax]] taken from a conventional [[programming language]] with [[mathematical notation]], typically using [[set theory]] and [[matrix (mathematics)|matrix]] operations, and perhaps also [[natural language]] descriptions. 

It can be understood by a wide range of mathematically trained people, and is used as a way to describe [[algorithm]]s where the [[control structure]] is made explicit at a rather high level of detail, while some data structures are still left at an abstract level, independent of any specific programming language. 

Normally non-[[ASCII]] [[typesetting]] is used for the mathematical equations, for example by means of [[TeX]] or [[MathML]] markup, or proprietary [[Formula editor]] formats. 

These are examples of articles that contain mathematical style pseudocode:

{{colbegin|colwidth=25em}}
*[[Algorithm]]
*[[Conjugate gradient method]]
*[[Ford-Fulkerson algorithm]]
*[[Gauss–Seidel method]]
*[[Generalized minimal residual method]]
*[[Jacobi eigenvalue algorithm]]
*[[Jacobi method]]
*[[Karmarkar's algorithm]]
*[[Particle swarm optimization]]
*[[Stone method]]
*[[Successive over-relaxation]]
*[[Symbolic Cholesky decomposition]]
*[[Tridiagonal matrix algorithm]]
{{colend}}

==References==
{{reflist}}

[[Category:Algorithm description languages]]