What is the time complexity of Radix Sort in terms of Big O notation?

The time complexity of Radix Sort is O(nk), where n is the number of elements in the input array and k is the number of digits in the largest element.