# collisions on hash functions

Why do we say that collision-resistance is a "harder" property than second pre-image for hash functions whereas if you have an attack on the second pre-image then you find a collision ? Moreover, a collision has a good probability to be found in $O(\sqrt{N})$ where $N$ is the size of the hash function outputs, whereas second pre-image needs $O(N)$ ...