What is merge sort?

The input sequence of length N is divided into two subsequences of length N /2.

Merge sort is used for these two subsequences respectively.

Combine two sorted subsequences into a final sorted sequence.

So basically it’s split, merge, sort at the same time

chestnuts

Merge sort is like a tournament

For example, there are 8 martial artists A, B, C, D, E, F, G, AND H participating in the tournament.

First round, pairs, 4 winners (quarterfinals)

Second round, two pairs, two winners (semi-finals)

In the third round, there are only two teams left, and the champion wins (final)

Algorithm description

What is merge sort? Merge sort in detail

The content/inspiration of the article is taken from below

• Continuous maintenance/update 500+ front end questions/notes github.com/noxussj/Int…

• [Big data visualization chart plug-in] www.npmjs.com/package/ns-…

• [3D city modeling using three.js (Zhuhai)] 3D.noxussJ.top /