Complexity of Prims Algorithm

Just wanted to make sure that if the complexity of Prims Algorithm is O(E),where E=no. of edges?

@officialsoumalya ElogV to be exact but as you know logV is generally small.
dont forget to hit like and mark resolved if cleared :smiley: