Prims algorithm and Dijkstra's algorithm?

Hey just wanted to know the main differences between Dijkstra's algorithm and prims algorithm. I found the formulas etc so i know they work differently, but i wanted to know if one is more efficent than another - such as when big Oh notation is taken into account etc.