Changeset 2042:bdc953f2a449 in lemon-0.x for lemon/radix_sort.h

Timestamp:

04/07/06 11:54:35 (18 years ago)

Author:

Balazs Dezso

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2681

Message:

New Algorithm group for matchings

LaTeX formulas
Bug fix => /\f$ will cause parsing error in doxygen

File:

• lemon/radix_sort.h (modified) (2 diffs)

lemon/radix_sort.h

@@ -209 +209 @@
   /// is choosen to partite the items on the next bit. This way, let be
   /// \c c the maximal capacity and \c n the number of the items in
-  /// the container, the time complexity of the algorithm \c O(log(c)*n)
-  /// and the additional space complexity is \c O(log(c)).
+  /// the container, the time complexity of the algorithm 
+  /// \f$ O(\log(c)n) \f$ and the additional space complexity is 
+  /// \f$ O(\log(c)) \f$.
   ///
   /// \param first The begin of the given range.
@@ -430 +431 @@
   /// whole value. This way, let be \c c the maximal capacity of the integer 
   /// type and \c n the number of the items in
-  /// the container, the time complexity of the algorithm \c O(log(c)*n)
-  /// and the additional space complexity is \c O(n).
+  /// the container, the time complexity of the algorithm \f$ O(\log(c)n) \f$
+  /// and the additional space complexity is \f$ O(n) \f$.
   ///
   /// This sorting algorithm is stable so the order of two equal element