What is the complexity of the calculation algorithm?

Question

Algorithms

Given a list of cities. Their names and regions are known, but the coordinates are unknown. The algorithm goes through the list of cities and each time accesses the server, getting the coordinates or getting an error. If coordinates are received, they are assigned to the city and it is removed from the list. When the algorithm reaches the end, if there are elements left in the list, then the function for the remaining list is called recursively. I suspect that this is O(n*log n)