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

## Array Data Structure

Examples involving the array data structure

- A Sudoku solver
- Algorithm 63 (partition)
- Algorithm 64 (quicksort)
- Algorithm 65 (find)
- Binary Heaps in Why3
- Binary Search, Java version
- Binary Search, SPARK/Ada version
- Binary search
- Boyer and Moore's MJRTY algorithm (1980)
- Bubble sort
- Circular queue in an array
- Coincidence count
- Dijkstra's Dutch Flag, Java version
- Dijkstra's national flag (variant)
- Edition distance
- Extract non-zero values from an array
- Filter elements of an array
- Find the maximal element in an array
- FoVeOOS'11 Competition: challenge 1, in C
- FoVeOOS'11 Competition: challenge 1, in Java
- FoVeOOS'11 Competition: challenge 1, in Why3
- FoVeOOS'11 Competition: challenge 3 in Why3
- FoVeOOS'11 Competition: challenge 3, in C
- FoVeOOS'11 Competition: challenge 3, in Java
- Hash tables with linear probing
- Hoare's
*Proof of a Program: FIND* - Insertion Sort, C version
- Insertion sort (arrays)
- Inverse in place
- Inverting an Injection, in Why3
- Knuth's prime numbers
- Knuth-Morris-Pratt string searching algorithm
- Maximum subarray problem
- Mergesort (arrays)
- Optimal replay
- Quicksort (arrays)
- Remove duplicate elements in an array, in-place
- Removing duplicate elements in an array, using a mutable set
- Resizable arrays
- Searching a zero in an array where values never decrease by more than one
- Selection Sort, C version
- Selection Sort, Java version
- Selection sort (arrays)
- Sort an array of Boolean values
- Sort an array of integers, assuming all elements are in the range 0..k-1
- Sparse Arrays in Capucine
- Sparse Arrays in Why3
- Sum and Maximum, in Why3
- Sum of values in an array, C version
- VerifyThis @ FM 2012, problem 1
- VerifyThis @ FM 2012, problem 2

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