We give an algorithm for the disjoint set union problem, within the class of algorithms defined by Tarjan, which has single-operation time complexity in the worst case. Also we define a class of algorithms for the disjoint set union problem, which includes the class of algorithms defined by Tarjan. We prove that any algorithm from this class has at least single-operation time complexity in the worst case.