What is the time complexity of a while loop in a given algorithm?

The time complexity of a while loop in an algorithm is typically represented as O(n), where n is the number of iterations the loop performs.