1.1 --- a/lemon/radix_sort.h	Mon Jan 12 23:11:39 2009 +0100
     1.2 +++ b/lemon/radix_sort.h	Thu Nov 05 15:48:01 2009 +0100
     1.3 @@ -205,11 +205,11 @@
     1.4    /// the identity function instead.
     1.5    ///
     1.6    /// This is a special quick sort algorithm where the pivot
     1.7 -  /// values to split the items are choosen to be \f$ 2^k \f$ for each \c k.
     1.8 -  /// Therefore, the time complexity of the
     1.9 -  /// algorithm is \f$ O(\log(c)n) \f$ and it uses \f$ O(\log(c)) \f$,
    1.10 -  /// additional space, where \c c is the maximal value and \c n is the
    1.11 -  /// number of the items in the container.
    1.12 +  /// values to split the items are choosen to be 2<sup>k</sup>
    1.13 +  /// for each \c k.
    1.14 +  /// Therefore, the time complexity of the algorithm is O(log(c)*n) and
    1.15 +  /// it uses O(log(c)) additional space, where \c c is the maximal value
    1.16 +  /// and \c n is the number of the items in the container.
    1.17    ///
    1.18    /// \param first The begin of the given range.
    1.19    /// \param last The end of the given range.
    1.20 @@ -430,10 +430,10 @@
    1.21    /// bytes of the integer number. The algorithm sorts the items
    1.22    /// byte-by-byte. First, it counts how many times a byte value occurs
    1.23    /// in the container, then it copies the corresponding items to
    1.24 -  /// another container in asceding order in \c O(n) time.
    1.25 +  /// another container in asceding order in O(n) time.
    1.26    ///
    1.27 -  /// The time complexity of the algorithm is \f$ O(\log(c)n) \f$ and
    1.28 -  /// it uses \f$ O(n) \f$, additional space, where \c c is the
    1.29 +  /// The time complexity of the algorithm is O(log(c)*n) and
    1.30 +  /// it uses O(n) additional space, where \c c is the
    1.31    /// maximal value and \c n is the number of the items in the
    1.32    /// container.
    1.33    ///