What is the time complexity of a while loop in terms of its efficiency and performance?

The time complexity of a while loop is typically expressed as O(n), where n represents the number of iterations the loop performs. This indicates that the efficiency and performance of the while loop are directly proportional to the size of the input data.