Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.programming.threads > #5288
| From | Bonita Montero <Bonita.Montero@gmail.com> |
|---|---|
| Newsgroups | comp.programming.threads |
| Subject | Re: About Parallel Sorting.. |
| Date | 2019-11-18 07:37 +0100 |
| Organization | albasani.net |
| Message-ID | <qqte6g$8kn$1@news.albasani.net> (permalink) |
| References | <025d8889-93b2-4b52-b814-cc6385d114c4@googlegroups.com> <f3878706-687f-4710-a193-0ff0a28e3cf7@googlegroups.com> |
> I think there is an In-place Merge > Sort algorithm that works faster, > using only optimal O(n log n) time. > Read more here to notice it: > http://www.cs.nthu.edu.tw/~wkhon/algo08-tutorials/tutorial1b.pdf Read it yourself! The in-place-merging is extremely slow!
Back to comp.programming.threads | Previous | Next — Previous in thread | Find similar | Unroll thread
About Parallel Sorting.. aminer68@gmail.com - 2019-11-17 11:34 -0800
Re: About Parallel Sorting.. aminer68@gmail.com - 2019-11-17 11:55 -0800
Re: About Parallel Sorting.. Bonita Montero <Bonita.Montero@gmail.com> - 2019-11-18 07:37 +0100
csiph-web