In computer science, pseudocode is a description of the steps in an algorithm using a mix of conventions of programming languages (like assignment operator...

interprets pseudocode in Spanish, the Android version interprets pseudocode in English, Spanish and Portuguese. PSeInt is the abbreviation of PSeudocode Interpreter...

host programming language but allow good abstraction in the pseudocode) and a pseudocode program that defines the syntax of the input language by the...

program structures and so called dummy code. Program skeletons resemble pseudocode, but allow parsing, compilation and testing of the code. Dummy code is...

documenting methods and procedures in software. It is related to pseudocode, but unlike pseudocode, it is written in plain language without any terms that could...

Fitness proportionate selection, also known as roulette wheel selection or spinning wheel selection, is a selection technique used in evolutionary algorithms...

A microframework is a term used to refer to minimalistic web application frameworks. It is contrasted with full-stack frameworks. It lacks most of the...

while separate chaining typically can use up to 100%. The following pseudocode is an implementation of an open addressing hash table with linear probing...

transform dithering. The algorithm described above is in the following pseudocode. This works for any approximately linear encoding of pixel values, such...

Pseudocode for implementing critical section...

The Berlekamp–Massey algorithm is an algorithm that will find the shortest linear-feedback shift register (LFSR) for a given binary output sequence. The...

Backtracking is a class of algorithms for finding solutions to some computational problems, notably constraint satisfaction problems, that incrementally...

more recent and may correlate better with the next input. The following pseudocode is a reproduction of the LZ77 compression algorithm sliding window. while...

floating-point operation, around 20% of which are multiplications.) In pseudocode, the below procedure could be written: X0,...,N−1 ← ditfft2(x, N, s):...

increasing number of calculations needed (see examples below). The following pseudocode in MATLAB style demonstrates Richardson extrapolation to help solve the...

The Kernighan–Lin algorithm is a heuristic algorithm for finding partitions of graphs. The algorithm has important practical application in the layout...

In graph theory, a vertex cover (sometimes node cover) of a graph is a set of vertices that includes at least one endpoint of every edge of the graph....

using a specific programming language, the algorithms are written in pseudocode. The descriptions focus on the aspects of the algorithm itself, its mathematical...

signals, the GS algorithm is also valid for one-dimensional signals. The pseudocode below performs the GS algorithm to obtain a phase distribution for the...

The Viterbi algorithm is a dynamic programming algorithm for obtaining the maximum a posteriori probability estimate of the most likely sequence of hidden...

Effective Hand Strength (EHS) is a poker algorithm conceived by computer scientists Darse Billings, Denis Papp, Jonathan Schaeffer and Duane Szafron that...

as possible to pseudocode and analyzed hundreds of computer science and mathematics papers, courses, books and journals using pseudocode to extract the...

Shellsort, also known as Shell sort or Shell's method, is an in-place comparison sort. It can be understood as either a generalization of sorting by exchange...

each displayed frame, to make the sprite appear to move. The following pseudocode makes a sprite move from left to right: var int x := 0, y := screenHeight...

Breadth-first search (BFS) is an algorithm for searching a tree data structure for a node that satisfies a given property. It starts at the tree root and...

DSatur is a graph colouring algorithm put forward by Daniel Brélaz in 1979. Similarly to the greedy colouring algorithm, DSatur colours the vertices of...

The Barnsley fern is a fractal named after the British mathematician Michael Barnsley who first described it in his book Fractals Everywhere. He made it...

be expressed in many kinds of notation, including natural languages, pseudocode, flowcharts, drakon-charts, programming languages or control tables (processed...

demonstrates the computation that would be performed in evaluating the pseudocode above: This factorial function can also be described without using recursion...

ELIZA is an early natural language processing computer program developed from 1964 to 1967 at MIT by Joseph Weizenbaum.[page needed] Created to explore...