COIN-OR::LEMON - Graph Library

Changeset 606:c5fd2d996909 in lemon for lemon/radix_sort.h


Ignore:
Timestamp:
03/29/09 23:08:20 (10 years ago)
Author:
Peter Kovacs <kpeter@…>
Branch:
default
Phase:
public
Message:

Various doc improvements (#248)

  • Rename all the ugly template parameters (too long and/or starting with an underscore).
  • Rename function parameters starting with an underscore.
  • Extend the doc for many classes.
  • Use LaTeX-style O(...) expressions only for the complicated ones.
  • A lot of small unification changes.
  • Small fixes.
  • Some other improvements.
File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/radix_sort.h

    r467 r606  
    206206  ///
    207207  /// This is a special quick sort algorithm where the pivot
    208   /// values to split the items are choosen to be \f$ 2^k \f$ for each \c k.
    209   /// Therefore, the time complexity of the
    210   /// algorithm is \f$ O(\log(c)n) \f$ and it uses \f$ O(\log(c)) \f$,
    211   /// additional space, where \c c is the maximal value and \c n is the
    212   /// number of the items in the container.
     208  /// values to split the items are choosen to be 2<sup>k</sup>
     209  /// for each \c k.
     210  /// Therefore, the time complexity of the algorithm is O(log(c)*n) and
     211  /// it uses O(log(c)) additional space, where \c c is the maximal value
     212  /// and \c n is the number of the items in the container.
    213213  ///
    214214  /// \param first The begin of the given range.
     
    431431  /// byte-by-byte. First, it counts how many times a byte value occurs
    432432  /// in the container, then it copies the corresponding items to
    433   /// another container in asceding order in \c O(n) time.
    434   ///
    435   /// The time complexity of the algorithm is \f$ O(\log(c)n) \f$ and
    436   /// it uses \f$ O(n) \f$, additional space, where \c c is the
     433  /// another container in asceding order in O(n) time.
     434  ///
     435  /// The time complexity of the algorithm is O(log(c)*n) and
     436  /// it uses O(n) additional space, where \c c is the
    437437  /// maximal value and \c n is the number of the items in the
    438438  /// container.
Note: See TracChangeset for help on using the changeset viewer.