hi,I want to sort a array a[10000] of which first 5000 elements are stored in sorted order,and I want to sort last 5000 elements.So tell me which sorting algorithm will be best so that my complexity is minimum.
I dont think so quick sort is good to do this task.
Thank You,
Nitin.
> I dont think so quick sort is good to do this task.
quicksort the 2nd half, then mergesort both halves.
Or just quicksort the whole lot without any more thought and find something else more important which needs doing, until you know for sure that this is actually a performance bottleneck.
If you dance barefoot on the broken glass of undefined behaviour, you've got to expect the occasional cut.
If at first you don't succeed, try writing your phone number on the exam paper.
Try sorting the second half and then merging it with the first half.
