Merge sort algorithm

Merge sort algorithm is an old one, it was first invented in 40s. Regardless of its age, it is a good one.

Another name for this algorithm is a divide and conquer algorithm. It is a way to divide original set into smaller sets and solving the problem from the smaller sets and merging the answers.

There are additional algorithms, but I am not going to explain details of these in here because these are less popular.

Performance of algorithm may be good for a small set of data, however as the amount of data grows than the algorithm may need to be adjusted.

Additionally algorithm performance may depend on if data is sorted or not, and if there are any duplication of data.

Comments

Popular posts from this blog

Absolute and relative path in HTML pages

Errors

goto PHP operator