Merge sort, advantages and disadvantages

?

Sorting data (merge)

Advantages

  • It is quicker for larger lists because unlike insertion and bubble sort it doesnt go through the whole list seveal times.
  • It has a consistent running time, carries out different bits with similar  times in a stage.

Disadvantages

  • Slower comparative to the other sort algorithms for smaller tasks.
  • goes through the whole process even i he list is sorted (just like insertion and bubble sort?)
  • uses more memory space to store the sub elements of the initial split list.

Evaluation

.WHAT IS A MERGE SORT ?:                    It is a type of sorting algorithm which follows the principle of 'divide and conquer'. The first stage is where the list is split until it forms individual elements called sub-lists. After this, the 'merge' stage begins. Here the sub-lists  are paired up and are arranged according to the order stated (ascending/descending). these paired lists are paired again to form groups of 4 and are again arranged according to the intended/ given order. This process happens until the sub-lists form one list. 

Comments

SilasMueller

Report

This is the first time I am reading about this and come to know that this used at surgery time. As is I am literature student I don`t have any good idea about the medicines and its use for the patients. It is very good that I have come across this blog while looking for 

https://spacecoastdaily.com/2019/05/how-to-get-the-most-from-the-online-assignment-help/

blogs and happy that I am getting some knowledge on medicines.

Similar Computing resources:

See all Computing resources »See all Software resources »