How to determine the time complexity of reversing a singly linked list?

The time complexity of reversing a singly linked list is O(n), where n is the number of elements in the list. This is because you need to traverse all the nodes in the list once, changing the links to the previous element.