Complexity Analysis of Algorithms      [To Top]

The following article describes the theoretical background on evaluating the performance of algorithms and programs.

How to implement common datastructures (List, Stack, Map) in plain Java      [To Top]

This article describes how to implement data structures (List Stack, Map) in Java.

The implementations in this articles are for demonstration and education purpose. They do not try to be as efficient as the standard libraries and they are not intended to be an replacement for the standard libraries.

Split / Partition a collection into smaller collections - Java      [To Top]

This article describes how to partition a collections into a given number of smaller collections.

MapReduce      [To Top]

This article lists several resources which describes MapReduce.

Quicksort in Java      [To Top]

This article describes how to implement Quicksort with Java.

Mergesort in Java      [To Top]

This article describes how to implement Mergesort with Java.

Sequential and binary search implemented in Java      [To Top]

This article describes different search algorithms for searching elements in collections. Currently sequential search and binary search are described.

Euclid's algorithm for the greatest common divisor in Java      [To Top]

This article describes how to calculate in Java the greatest common divisor of two positive number with Euclid's algorithm.

Shuffle an Array or a List - Algorithm in Java      [To Top]

This article describes how to shuffle the content of an array or a list in Java. After the shuffle the elements in the array or the list are randomly sorted.

Determine Prime Number with the Sieve of Eratosthenes - Algorithm in Java      [To Top]

This article describes the calculation of prime numbers with the sieve of Eratosthenes in Java

Prime Factorization - Algorithm in Java      [To Top]

This article describes how to perform prime factorization with Java.

Towers of Hanoi - Java      [To Top]

This article describes how to solve the Towers of Hanoi in Java.

Dijkstra's Shortest Path Algorithm in Java      [To Top]

Dijkstra's Algorithms describes how to find the shortest path from one node to another node in a directed weighted graph. This article presents a Java implementation of this algorithms.