The time complexity in Kruskal’s algorithm is O(E log V), where V is the number of vertices.