1.1 --- a/lemon/radix_sort.h	Fri Apr 07 09:52:30 2006 +0000
     1.2 +++ b/lemon/radix_sort.h	Fri Apr 07 09:54:35 2006 +0000
     1.3 @@ -208,8 +208,9 @@
     1.4    /// This implemented radix sort is a special quick sort which pivot value
     1.5    /// is choosen to partite the items on the next bit. This way, let be
     1.6    /// \c c the maximal capacity and \c n the number of the items in
     1.7 -  /// the container, the time complexity of the algorithm \c O(log(c)*n)
     1.8 -  /// and the additional space complexity is \c O(log(c)).
     1.9 +  /// the container, the time complexity of the algorithm 
    1.10 +  /// \f$ O(\log(c)n) \f$ and the additional space complexity is 
    1.11 +  /// \f$ O(\log(c)) \f$.
    1.12    ///
    1.13    /// \param first The begin of the given range.
    1.14    /// \param last The end of the given range.
    1.15 @@ -429,8 +430,8 @@
    1.16    /// by each bytes in forward direction which sorts the container by the
    1.17    /// whole value. This way, let be \c c the maximal capacity of the integer 
    1.18    /// type and \c n the number of the items in
    1.19 -  /// the container, the time complexity of the algorithm \c O(log(c)*n)
    1.20 -  /// and the additional space complexity is \c O(n).
    1.21 +  /// the container, the time complexity of the algorithm \f$ O(\log(c)n) \f$
    1.22 +  /// and the additional space complexity is \f$ O(n) \f$.
    1.23    ///
    1.24    /// This sorting algorithm is stable so the order of two equal element
    1.25    /// stay in the same order.