see also the index (by topic, by tool, by reference, by year)

## 2012

Examples of year 2012

- Accurate discriminant
- Algorithm 63 (partition)
- Algorithm 64 (quicksort)
- Algorithm 65 (find)
- An example from EWD 673
- Area of a triangle
- Bellman-Ford algorithm
- Binary Square Root
- Boyer and Moore's MJRTY algorithm (1980)
- Dijkstra's national flag (variant)
- Discretization of the 1D acoustic wave equation
- Exact subtraction: Sterbenz's theorem
- Find the maximal element in an array
- Generate all binary trees of size n
- In-Place Linked-List Reversal in Why3
- Linear recurrence of order 2
- Malcolm algorithm to determine the radix
- Optimal replay
- Red-black trees
- Resizable arrays
- Snapshotable Trees
- Sort an array of integers, assuming all elements are in the range 0..k-1
- Summing the elements of a list
- Traversing a tree inorder, filling an array
- Unraveling a Card Trick
- VerifyThis @ FM 2012, problem 1
- VerifyThis @ FM 2012, problem 2
- VerifyThis @ FM 2012, problem 3
- WP revisited in Why3

see also the index (by topic, by tool, by reference, by year)