I am currently having trouble identifying and understanding the complexity time of the following algorithm.
Background: There is a list of files, each containing a list of candidate Ids. Both, number of files and number of candidates within them are not fixed.
How would you calculate the time complexity for an algorithm which is responsible for:
Reading each file and adding all the unique candidate Ids into a Hashset?