Elementary Algorithms Using Discrete Loops

The following examples of classic algorithms show the effective use of the 'discrete loop'-construct developped under the WOOP project defined in the paper Discrete Loops And Worst Case Performance (J. Blieberger, Department of Automation at the Technical University of Vienna).

Algorithms

Mathematical algorithms

• Euclid's Algorithm
• Fast Fourier Transformation
• Fibonacci numbers
• Josephus algorithm

Tree algorithms

• Binary tree traversal
• AVL tree traversal
• BB[alpha] tree traversal

Search algorithms

• Binary search
• Fibonacci search
• Interpolation search

Sorting algorithms

• Heap sort
• Merge sort
• Shell sort

Note: To compile and use the examples from this pages, you have to install the precompiler for the discrete loops (WPP). For further information concerning the precompiler, please refer to the WOOP Project.

[ About the Authors | Bibliography ]