The technique of merging: Merge
sort is a sort algorithm that splits the items to be sorted into two groups;
recursively sorts each group, and merges them into a final sorted sequence.
Features:
(i) It is a
comparison based algorithm.
(ii) It is a stable
algorithm.
(iii) It is a perfect
example of divide & conquers algorithm design strategy.
(iv) It was invented
by john von Neumann.
No comments:
Post a Comment