2008
2007
2006
Heapsort
by YukuanMark
With its time complexity of O(n log(n)) heapsort is optimal. It utilizes a special data structure called heap. This data structure is explained in the following.
Idiot World - 5 algorithms you must know
by YukuanMark & 4 others
Especially if you're a coder, but does come up in real life too. Algorithms are underrated and probably underused - it comes up maybe 1% of the time, but in that 1% of the time, it's 100% important. These are real algorithms, with real-world application,
2005
Some Programming Tricks in the unofficial comp.dsp homepage
by nachilau
This webpage contains some tricks to calculating certain things, likfe fast approximation of Sin and Cos, fast approximation of vector's length, Square root computation etc...
Dictionary of Algorithms and Data Structures
by Riduidel & 20 others
This is a dictionary of algorithms, algorithmic techniques, data structures, archetypical problems, and related definitions.
Treemaps for space-constrained visualization of hierarchies
by Riduidel & 1 other
Landscape of the TreeMap technology and code samples (in Java)
Numerical Recipes in C
by Riduidel & 2 others
Thanks to special permission from Cambridge University Press, we are able to bring you the complete Numerical Recipes in C book On-Line! To utilize this resource, you will need an Adobe Acrobat viewer linked as a helper program to your web browser. Permis
Mathtools.net - Link Exchange for the Technical Computing Community
by Riduidel & 3 others
Link exchange for the technical computing community
Algorithmique du texte
by Riduidel
Il s'agit du premier ouvrage en Français d'algorithmique spécialisée sur le traitement du texte. Il suppose une connaissance de base des méthodes de conception de programmes et d'évaluation de leurs performances. Il peut être utilisé
The Theory of Concatenative Combinators
by Riduidel
This article describes a new theory of combinators, similar in many ways to the theory of Combinatory Logic pioneered by Haskell Curry and others in the 1930s. Thus, although not essential, it would be helpful for the reader to have an understanding of th
