a question about complexity analysis in this paper

[GitHub-Crow]

Unit Region in this paper is exactly a "buket sorting" process with time complexity O(N), while in paper, this process cost O(MN). Is there anything I misread or miss?

[firstelfin]

The first loop traverses the samples, the second loop traverses the neighborhood @GitHub-Crow