Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Pidgin code
open-in-new
<h2 id="examples">Examples</h2> <p>In <a href="/facts/Numerical_computation/QT9cYa9z">numerical computation</a>, mathematical style pseudocode is sometimes called pidgin code, for example <i>pidgin <a href="/facts/ALGOL/wlFJGNEx">ALGOL</a></i> (the origin of the concept), <i>pidgin <a href="/facts/Fortran/m1KqjcMU">Fortran</a></i>, <i>pidgin <a href="/facts/BASIC/VYMl5TmA">BASIC</a></i>, <i>pidgin <a href="/facts/Pascal_(programming_language)/b3yvp8bF"> Pascal</a></i>, and <i>pidgin <a href="/facts/C_(programming_language)/Ky2No763"> C</a></i>. It is a compact and often informal notation that blends <a href="/facts/Syntax/6PxSV98p">syntax</a> taken from a conventional <a href="/facts/Programming_language/cWTYbgWa">programming language</a> with <a href="/facts/Mathematical_notation/vHgEE8cE">mathematical notation</a>, typically using <a href="/facts/Set_theory/1ptfsvUP">set theory</a> and <a href="/facts/Matrix_(mathematics)/qa8FI4ko">matrix</a> operations, and perhaps also <a href="/facts/Natural_language/B4gLS7Kd">natural language</a> descriptions. </p><p>It can be understood by a wide range of mathematically trained people, and is used as a way to describe <a href="/facts/Algorithm/fnl5NmRt">algorithms</a> where the <a href="/facts/Control_structure/2XTDfErC">control structure</a> 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. </p><p>Normally non-<a href="/facts/ASCII/vGUI33Qu">ASCII</a> <a href="/facts/Typesetting/CsKmfY0t">typesetting</a> is used for the mathematical equations, for example by means of <a href="/facts/TeX/HDrl3Yvd">TeX</a> or <a href="/facts/MathML/uKRIc3Fy">MathML</a> markup, or proprietary <a href="/facts/Formula_editor/14nEhIrV">Formula editor</a> formats. </p><p>These are examples of articles that contain mathematical style pseudocode: </p> <ul><li><a href="/facts/Algorithm/fnl5NmRt">Algorithm</a></li> <li><a href="/facts/Conjugate_gradient_method/AFwzBS4U">Conjugate gradient method</a></li> <li><a href="/facts/Ford-Fulkerson_algorithm/wwk3tw52">Ford-Fulkerson algorithm</a></li> <li><a href="/facts/Gauss%25E2%2580%2593Seidel_method/eK94QeFt">Gauss–Seidel method</a></li> <li><a href="/facts/Generalized_minimal_residual_method/Ak7gbYzI">Generalized minimal residual method</a></li> <li><a href="/facts/Jacobi_eigenvalue_algorithm/0gE5vpje">Jacobi eigenvalue algorithm</a></li> <li><a href="/facts/Jacobi_method/aNf3WE63">Jacobi method</a></li> <li><a href="/facts/Karmarkar%2527s_algorithm/rprPV1Wu">Karmarkar's algorithm</a></li> <li><a href="/facts/Particle_swarm_optimization/QYo2YaP7">Particle swarm optimization</a></li> <li><a href="/facts/Stone_method/2IakVyWI">Stone method</a></li> <li><a href="/facts/Successive_over-relaxation/rCUV11er">Successive over-relaxation</a></li> <li><a href="/facts/Symbolic_Cholesky_decomposition/LJWKlXTy">Symbolic Cholesky decomposition</a></li> <li><a href="/facts/Tridiagonal_matrix_algorithm/NREF5x1c">Tridiagonal matrix algorithm</a></li></ul> <h2 id="references">References</h2> <ol> <li id="fn:1"><p>DAT10603 Programming Principle. Center for Diploma Studies, Hannes Masandig. p. 125. <a href="https://books.google.com/books?id=78dO3P_QjPgC" target="_blank">https://books.google.com/books?id=78dO3P_QjPgC</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li> <li id="fn:2"><p>"Pseudocode". CodeDocs. 2021-06-18. Retrieved 2025-03-01. <a href="https://codedocs.org/what-is/pseudocode" target="_blank">https://codedocs.org/what-is/pseudocode</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li> </ol>