Changeset 606:c5fd2d996909 in lemon for lemon/radix_sort.h
 Timestamp:
 03/29/09 23:08:20 (10 years ago)
 Branch:
 default
 Phase:
 public
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/radix_sort.h
r467 r606 206 206 /// 207 207 /// 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 the210 /// 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 the212 /// 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. 213 213 /// 214 214 /// \param first The begin of the given range. … … 431 431 /// bytebybyte. First, it counts how many times a byte value occurs 432 432 /// in the container, then it copies the corresponding items to 433 /// another container in asceding order in \cO(n) time.434 /// 435 /// The time complexity of the algorithm is \f$ O(\log(c)n) \f$and436 /// it uses \f$ O(n) \f$,additional space, where \c c is the433 /// 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 437 437 /// maximal value and \c n is the number of the items in the 438 438 /// container.
Note: See TracChangeset
for help on using the changeset viewer.