Algorithms and Data Structures

Martin Steffen

Abstract: These pages contain some of the algorithms of our lecture in the functional (and object-oriented) language ocaml It is automtically generated by the literate-programming tool ocamlweb.

• Introduction
• Some basic definitions
• Module Basic
• Sorting
• Interface for module Randlists
• Module Sort
• Interface for module Bubblesort
• Module Bubblesort
• Module Heapsort
• Module Mergesort
• Module Quicksort
• Interface for module Quicksort1
• Module Quicksort1
• Interface for module Quicksort2
• Module Quicksort2
• Module Insertion
• Module Selsort
• Miscellaneous
• Interface for module Maxseq
• Module Maxseq
• Interface for module Linpartition
• Module Linpartition
• Heaps
• Interface for module Heap
• Module Heap
• Trees
• Interface for module Trees
• Module Trees
• Interface for module Rbtrees
• Module Rbtrees
• Interface for module Rbtrees2
• Module Rbtrees2
• Graphs
• Interface for module Graphs
• Module Graphs
• Module Scc
• Index
• References

This document was translated from L^AT_EX by H^EV^EA and H^AC^HA.