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

Ignore:
Timestamp:
03/29/09 23:08:20 (10 years ago)
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

Unmodified
Added
Removed
• ## lemon/radix_sort.h

 r467 /// /// This is a special quick sort algorithm where the pivot /// values to split the items are choosen to be \f\$ 2^k \f\$ for each \c k. /// Therefore, the time complexity of the /// algorithm is \f\$ O(\log(c)n) \f\$ and it uses \f\$ O(\log(c)) \f\$, /// additional space, where \c c is the maximal value and \c n is the /// number of the items in the container. /// values to split the items are choosen to be 2k /// for each \c k. /// Therefore, the time complexity of the algorithm is O(log(c)*n) and /// it uses O(log(c)) additional space, where \c c is the maximal value /// and \c n is the number of the items in the container. /// /// \param first The begin of the given range. /// byte-by-byte. First, it counts how many times a byte value occurs /// in the container, then it copies the corresponding items to /// another container in asceding order in \c O(n) time. /// /// The time complexity of the algorithm is \f\$ O(\log(c)n) \f\$ and /// it uses \f\$ O(n) \f\$, additional space, where \c c is the /// another container in asceding order in O(n) time. /// /// The time complexity of the algorithm is O(log(c)*n) and /// it uses O(n) additional space, where \c c is the /// maximal value and \c n is the number of the items in the /// container.
Note: See TracChangeset for help on using the changeset viewer.