A little... extension for C++

Loops are used on a daily base by almost every programmer. Especially for-loops occur quite often.

Now, have you ever felt it's quite cumbersome to code something like the following:

for (int i=0; i<10; ++i){
  do_something_here();
}

while you just wanted to write

10 times {
  do_something_here();
}

and wanted C++ to understand it?

Don't worry, here's the solution. Just include this little header file and everything will work fine.

Fibonacci numbers - the other way

Every programmer comes to the point where he or she must/should/wants to implement a programm for calculating fibonacci numbers. But I think my way is quite a new one.

Making of a winamp plugin

This post shows the basics of writing a very simple plugin for my favourite music player.

(Some of) my projects

In this post I want to present (some of) my (small) projects.

Dynamic programming - a gentle introduction

Dynamic programming is a quite well-known technique, but often not completely understood. This article provides a basic insight into dynamic programming. It shows some little examples and tries to explain the requirements so that dynamic programming is applicable.

Radix sort for float numbers

Radix sort is a linear sorting algorithm. However, it is commonly applied to integral values. This article shows, that - under certain circumstances - radix sort can be applied to floating point values as well.

Four easy to avoid programming mistakes

After my first post about mistakes relatively often made, but easy to avoid, i collected four more.

A nice method for...

Consider the following Code (in Python):

def dosomething(a, b):
    result=0
    while (a):
        if (a&1):
            result+=b
        b=b<<1
        a=a>>1
    return result

Logarithm of float numbers

Some time ago, a teacher asked me, how computers logarithmize float numbers.

Of couse, one could use the power series

The following article gives a general insight how floats could be logarithmized faster. It shows an approximative algorithm that can be extended to get more accurate results.

Quine

A program, that prints out its own source code, is called a quine. In every turing-complete programming language it is possible to generate such a program. This fact was proven by Stephen Kleene in his so called recursion theorem.

Today i wrote my first quine (in C):

int main(int argc, char *argv[]){char* s=\"int main(int argc, char *argv[]){char* s=%c%s%c;printf(s,34,s,34);}\";printf(s,34,s,34);}