some examples documented for the gallery

parent 2cf9906f
(** Check an array of integers for duplicate values,
using the fact that values are in interval [0,m-1]. *)
using the fact that values are in interval [0,m-1].
Authors: Jean-Christophe Filliâtre (CNRS)
Martin Clochard (École Normale Supérieure)
*)
module AllDistinct
......
......@@ -7,6 +7,9 @@
order and without duplicate elements, and you count the number of
elements that appear in both sequences (in linear time and constant
space).
Authors: Jean-Christophe Filliâtre (CNRS)
Andrei Paskevich (Université Paris Sud)
*)
module CoincidenceCount
......
(** Hash tables using linear probing
Authors: Martin Clochard (École Normale Supérieure)
Jean-Christophe Filliâtre (CNRS)
Authors: Jean-Christophe Filliâtre (CNRS)
Martin Clochard (École Normale Supérieure)
*)
module HashedTypeWithDummy
......
(** Skew heaps
Author: Jean-Christophe Filliâtre (CNRS)
*)
module Heap
use import int.Int
......
(** Topological sorting
Author: François Bobot (CEA)
*)
theory Graph
use export int.Int
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment