In computer science, when we encounter an algorithm, we often need to ask about the complexity of that algorithm (how many computations we need to do). To find the complexity of the distance vector’s algorithm, find the number of operations a node needs to do when it receives a vector from a neighbor.