Their time complexities are O(n) in the worst case and O(n/m) in the best case.

• 两个算法的最差、最好时间复杂度分别为O(n)和O(n/m).