[fusion] Adding to a map (1.42)
https://svn.boost.org/trac/boost/ticket/4604 I've got 1.42 though. Updating at this point isn't a good option. Is there a way to work around this so that I can add a new pair to an existing fusion map?
Can some one point me to a implementation of Quicksort or like algorithms using boost library thanks
Hi, 2011/4/5 Igor R <boost.lists@gmail.com>
Can some one point me to a implementation of Quicksort or like algorithms using boost library
std::sort() ?
I think that the algorithm used under std::sort() is implementation detail. The only specification is that it must be O(N log N) in average case. For example, the sorting algorithm used in GNU Standard C++ Library's std::sort() is the introsort algorithm, not quicksort. Regards, -- Murilo Adriano Vasconcelos http://murilo.wordpress.com
At Tue, 5 Apr 2011 18:40:02 -0300, Murilo Adriano Vasconcelos wrote:
Can some one point me to a implementation of Quicksort or like algorithms using boost library
std::sort() ?
I think that the algorithm used under std::sort() is implementation detail. The only specification is that it must be O(N log N) in average case. For example, the sorting algorithm used in GNU Standard C++ Library's std::sort() is the introsort algorithm, not quicksort.
In practice that means it's either using quicksort or introsort (until it gets to the leaves, where it might be doing insertion sort). And introsort is just quicksort until it starts to go pathological. So I'd say, apart from it not being in Boost, the answer "std::sort" is a pretty good one. -- Dave Abrahams BoostPro Computing http://www.boostpro.com
2011/4/5 Dave Abrahams <dave@boostpro.com>
At Tue, 5 Apr 2011 18:40:02 -0300, Murilo Adriano Vasconcelos wrote:
I think that the algorithm used under std::sort() is implementation detail.
The only specification is that it must be O(N log N) in average case. For example, the sorting algorithm used in GNU Standard C++ Library's std::sort() is the introsort algorithm, not quicksort.
In practice that means it's either using quicksort or introsort (until it gets to the leaves, where it might be doing insertion sort). And introsort is just quicksort until it starts to go pathological. So I'd say, apart from it not being in Boost, the answer "std::sort" is a pretty good one.
Yes, I missed the "or like" part. -- Murilo Adriano Vasconcelos http://murilo.wordpress.com
thanks ----- Original Message ----- From: "Dave Abrahams" <dave@boostpro.com> To: boost-users@lists.boost.org Sent: Tuesday, April 5, 2011 4:12:13 PM Subject: Re: [Boost-users] Quick Sort At Tue, 5 Apr 2011 18:40:02 -0300, Murilo Adriano Vasconcelos wrote:
Can some one point me to a implementation of Quicksort or like algorithms using boost library
std::sort() ?
I think that the algorithm used under std::sort() is implementation detail. The only specification is that it must be O(N log N) in average case. For example, the sorting algorithm used in GNU Standard C++ Library's std::sort() is the introsort algorithm, not quicksort.
In practice that means it's either using quicksort or introsort (until it gets to the leaves, where it might be doing insertion sort). And introsort is just quicksort until it starts to go pathological. So I'd say, apart from it not being in Boost, the answer "std::sort" is a pretty good one. -- Dave Abrahams BoostPro Computing http://www.boostpro.com _______________________________________________ Boost-users mailing list Boost-users@lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users
participants (5)
-
Dave Abrahams -
Igor R -
Murilo Adriano Vasconcelos -
Noah Roberts -
rpuri6＠comcast.net