The ProVal team was stopped at the end of August 2012, and reborn into a new team
Toccata

These pages do not evolve anymore, please follow the link above for up-to-date informations about our team.

## 2012

Examples of year 2012

- Red-black trees
- Unraveling a Card Trick
- Snapshotable Trees
- Boyer and Moore's MJRTY algorithm (1980)
- Hash table implementation
- Generate all binary trees of size n
- Find the maximal element in an array
- Dijkstra's national flag (variant)
- An example from EWD 673
- Sort an array of integers, assuming all elements are in the range 0..k-1
- Bellman-Ford algorithm
- Traversing a tree inorder, filling an array
- Algorithm 65 (find)
- Algorithm 64 (quicksort)
- Algorithm 63 (partition)
- Binary Square Root
- Summing the elements of a list
- Optimal replay
- Resizable arrays
- VerifyThis @ FM 2012, problem 2
- In-Place Linked-List Reversal in Why3