|
Boost Users : |
From: Mike Marchywka (marchywka_at_[hidden])
Date: 2008-08-21 06:49:28
> Date: Wed, 20 Aug 2008 16:29:08 +0200
> From: zvrba_at_[hidden]
> To: boost-users_at_[hidden]
> Subject: [Boost-users] How to find a sorting permutation
>
> I have a vector of element V that needs to be sorted. I want to also produce a
> permutation vector P which reflects the element's position in the original
> vector. P is initialized with identity permutation (P[i] == i).
>
If you haven't looked already, I would always suggest citeseer if for nothing else
than benchmarks and tests of whatever you decide to do. A quick naive keyword
search is as follows,
http://citeseerx.ist.psu.edu/search?q=sort+permutation+order&sort=rel
I think all of the papers are available free full text.
_________________________________________________________________
Get ideas on sharing photos from people like you. Find new ways to share.
http://www.windowslive.com/explore/photogallery/posts?ocid=TXT_TAGLM_WL_Photo_Gallery_082008
Boost-users list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net