COIN-OR::LEMON - Graph Library

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


Ignore:
Timestamp:
04/07/06 11:54:35 (14 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:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/radix_sort.h

    r2033 r2042  
    209209  /// is choosen to partite the items on the next bit. This way, let be
    210210  /// \c c the maximal capacity and \c n the number of the items in
    211   /// the container, the time complexity of the algorithm \c O(log(c)*n)
    212   /// and the additional space complexity is \c O(log(c)).
     211  /// the container, the time complexity of the algorithm
     212  /// \f$ O(\log(c)n) \f$ and the additional space complexity is
     213  /// \f$ O(\log(c)) \f$.
    213214  ///
    214215  /// \param first The begin of the given range.
     
    430431  /// whole value. This way, let be \c c the maximal capacity of the integer
    431432  /// type and \c n the number of the items in
    432   /// the container, the time complexity of the algorithm \c O(log(c)*n)
    433   /// and the additional space complexity is \c O(n).
     433  /// the container, the time complexity of the algorithm \f$ O(\log(c)n) \f$
     434  /// and the additional space complexity is \f$ O(n) \f$.
    434435  ///
    435436  /// This sorting algorithm is stable so the order of two equal element
Note: See TracChangeset for help on using the changeset viewer.