diff --git a/lemon/radix_sort.h b/lemon/radix_sort.h
--- a/lemon/radix_sort.h
+++ b/lemon/radix_sort.h
@@ -2,7 +2,7 @@
  *
  * This file is a part of LEMON, a generic C++ optimization library.
  *
- * Copyright (C) 2003-2008
+ * Copyright (C) 2003-2009
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
  *
@@ -348,7 +348,7 @@
                                      sizeof(Value) - 1, functor);
           std::copy(buffer + length, buffer + 2 * length, first);
         }        else {
-          signedStableRadixIntroSort(buffer + length, buffer + 2 * length, 
+          signedStableRadixIntroSort(buffer + length, buffer + 2 * length,
                                      buffer, sizeof(Value) - 1, functor);
           std::copy(buffer, buffer + length, first);
         }
@@ -360,7 +360,7 @@
     }
 
     template <typename Value, typename Iterator, typename Functor>
-    void stableRadixUnsignedSort(Iterator first, Iterator last, 
+    void stableRadixUnsignedSort(Iterator first, Iterator last,
                                  Functor functor) {
       if (first == last) return;
       typedef typename std::iterator_traits<Iterator>::value_type Key;
diff --git a/test/radix_sort_test.cc b/test/radix_sort_test.cc
--- a/test/radix_sort_test.cc
+++ b/test/radix_sort_test.cc
@@ -2,7 +2,7 @@
  *
  * This file is a part of LEMON, a generic C++ optimization library.
  *
- * Copyright (C) 2003-2008
+ * Copyright (C) 2003-2009
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
  *