It says:

We recursively divide the input list into two sublists, until a sublist with single element remains. This dividing step computes the midpoint of each of the sublists, which takes O(1) time. This step is repeated NN times until a single element remains, therefore the total time complexity is O(N).

However, it should be: O(logN). Which will result as a total complexity of O(NlogN).