i wish to know if i use only first order or second order to implement
On Thursday, March 13, 2014 9:11:12 PM UTC+1, Stefan Karpinski wrote: > > On Thu, Mar 13, 2014 at 11:19 AM, Ivar Nesje <[email protected]<javascript:> > > wrote: > >> We look forward to see posted julia code. Pull Requests is a great way to >> show your skills, whether they are accepted or not. Most of our sorting >> algorithms have been moved to >> SortingAlgorithms.jl<https://github.com/JuliaLang/SortingAlgorithms.jl>, >> so I would expect that it would be hard get a new algorithm accepted into >> base. >> > > Definitely submit new sorting algorithms to the SortingAlgorithms package > rather than base/sort.jl. We only want the minimal number of sorting > algorithms in base: quick sort, which is unstable but fast and in-place, > merge sort, which is stable and almost as fast but not in-place, and > insertion sort, which is stable and and in-place and fast for small arrays, > but slow for anything large, but makes and excellent base case for other > algorithms. It should be pretty obvious how to add a new sorting algorithm, > but feel free to ask questions if you need to. >
