Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.programming.threads > #6256
| From | Bonita Montero <Bonita.Montero@gmail.com> |
|---|---|
| Newsgroups | comp.programming.threads |
| Subject | Re: About the sorting algorithms.. |
| Date | 2021-01-19 10:10 +0100 |
| Organization | A noiseless patient Spider |
| Message-ID | <ru67lj$vqm$1@dont-email.me> (permalink) |
| References | <0aff4581-765d-4fc2-a043-e1bbe4d757c5n@googlegroups.com> |
> My Parallel Sort Library that is more efficient version 4.1 is here.. > Notice also in the source code that my Mergesort uses also insertion sort like in a Timsort manner, so it is very efficient. > You can download it from my website here: > https://sites.google.com/site/scalable68/parallel-sort-library-that-is-more-efficient You will never beat: std::stable_sort( std::parallel_policy(), begin, end, cmp );
Back to comp.programming.threads | Previous | Next — Previous in thread | Find similar | Unroll thread
About the sorting algorithms.. Amine Moulay Ramdane <aminer68@gmail.com> - 2021-01-18 11:44 -0800 Re: About the sorting algorithms.. Bonita Montero <Bonita.Montero@gmail.com> - 2021-01-19 10:10 +0100
csiph-web