qsort switching to insertsort

[Mehmet Erol Sanliturk]

On Sat, Nov 26, 2016 at 9:14 AM, Arne Dag Fidjestøl <adf at idi.ntnu.no> wrote:

>
> > On 26 Nov 2016, at 15:35, Mehmet Erol Sanliturk <m.e.sanliturk at gmail.com>
> wrote:
> >
> > In quick sort , it is necessary to check worst case and switch to another
> > sort method if it is detected .
> > When this is not done , end result is stack overflow , etc . , but not
> > success .
> > Therefore , it is not possible to eliminate an alternative sort method .
>
> I you sort the smaller partition recursively first, and then sort the
> larger partition either by tail recursion or iteration, you will only
> consume O(log n) of stack, so stack overflow needn’t be an issue,
> regardless of the input.
>
> -adf




Important problem is caused by almost sorted values . Myself , I am
counting the sorted elements first , if they exceed a large percentage of
number of all elements , then I am switching to an alternative sort ,
otherwise a quick sort is used .  This is for a simple application .

In an operating system , more complex algorithms may be more useful .


Mehmet Erol Sanliturk