lemon-main: comparison lemon/radix

equal deleted inserted replaced

-:1a43d1e5f7f0
+:a1eda04674f1
 /// It is also possible to use a normal function instead
 /// of the functor object. If the functor is not given it will use
 /// the identity function instead.
 ///
 /// 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.
+/// values to split the items are choosen to be 2<sup>k</sup>
-/// Therefore, the time complexity of the
+/// for each \c k.
-/// algorithm is \f$ O(\log(c)n) \f$ and it uses \f$ O(\log(c)) \f$,
+/// Therefore, the time complexity of the algorithm is O(log(c)*n) and
-/// additional space, where \c c is the maximal value and \c n is the
+/// it uses O(log(c)) additional space, where \c c is the maximal value
-/// number of the items in the container.
+/// and \c n is the number of the items in the container.
 ///
 /// \param first The begin of the given range.
 /// \param last The end of the given range.
 /// \param functor An adaptible unary function or a normal function
 /// which maps the items to any integer type which can be either
 ///
 /// This sort algorithm  use a radix forward sort on the
 /// bytes of the integer number. The algorithm sorts the items
 /// 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.
+/// another container in asceding order in O(n) time.
 ///
-/// The time complexity of the algorithm is \f$ O(\log(c)n) \f$ and
+/// The time complexity of the algorithm is O(log(c)*n) and
-/// it uses \f$ O(n) \f$, additional space, where \c c is the
+/// 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.
 ///
 /// \param first The begin of the given range.

changeset 1041	0b0327c9b3ef
parent 444	ba49101c9b07
child 1042	d450a02728d0