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.

## Array Data Structure

Examples involving the array data structure

- Insertion Sort, C version
- Selection Sort, C version
- Binary Search, Java version
- Selection Sort, Java version
- Filter elements of an array
- Dijkstra's Dutch Flag, Java version
- Find the maximal element in an array
- Dijkstra's national flag (variant)
- Sort an array of integers, assuming all elements are in the range 0..k-1
- Knuth's prime numbers
- Knuth-Morris-Pratt string searching algorithm
- FoVeOOS'11 Competition: challenge 3 in Why3
- Hoare's
*Proof of a Program: FIND* - Searching a zero in an array where values never decrease by more than one
- Extract non-zero values from an array
- Edition distance
- Quicksort (arrays)
- Selection sort (arrays)
- Insertion sort (arrays)
- Binary search
- Algorithm 65 (find)
- Algorithm 64 (quicksort)
- Algorithm 63 (partition)
- Optimal replay
- Resizable arrays
- Inverting an Injection, in Why3
- Sum and Maximum, in Why3
- Circular queue in an array
- Sort an array of Boolean values
- FoVeOOS'11 Competition: challenge 3, in C
- FoVeOOS'11 Competition: challenge 3, in Java
- FoVeOOS'11 Competition: challenge 1, in C
- FoVeOOS'11 Competition: challenge 1, in Java
- FoVeOOS'11 Competition: challenge 1, in Why3
- Binary Heaps in Why3
- Sparse Arrays in Capucine
- Sparse Arrays in Why3