Multiplying the polynomial time complexity

Copyright: Attribution, allow others to create paper-based, and must distribute paper (based on the original license agreement with the same license Creative Commons )

Data Structures and Algorithms analysis --c language to describe the practice 3.7

$O(M^2N^2)$
after each node of the index remained orderly ride

$O(M^2N)$
after each merge by

$O (MNlog (MN))$
for all take after, do a sort