Hi Kefar!
> 18 марта 2018 г., в 5:34, Kefan Yang написал(а):
>
> I am Kefan Yang, a third-year Computing Science student from Simon Fraser
> University, Canada. I am very interested in the sorting algorithm
> benchmarking and implementation issue you mentioned on the idealist of Google
> Summ
On Sat, Mar 17, 2018 at 7:00 PM, Kefan Yang wrote:
> What I am trying to say here is that similar optimizations can be applied to
> novel algorithms or other implementations of quicksort.
A novel algorithm is something to avoid here, because novel techniques
tend to only work out for specific dat
Thanks for your quick feedback!
"""
Industrial implementation of selected sorting algorithm:
The industrial version is basically an optimization based on the benchmark
implementation. I plan to use optimizations like checking if input
array is already sorted
or applying insertion sort directly for
On Sat, Mar 17, 2018 at 5:34 PM, Kefan Yang wrote:
> I am Kefan Yang, a third-year Computing Science student from Simon Fraser
> University, Canada. I am very interested in the sorting algorithm
> benchmarking and implementation issue you mentioned on the idealist of
> Google Summer of Code 2018.
Hi everyone,
I am Kefan Yang, a third-year Computing Science student from Simon Fraser
University, Canada. I am very interested in the *sorting algorithm
benchmarking and implementation* issue you mentioned on the idealist of
Google Summer of Code 2018.
I am currently working on my proposal, but
