For sorting algorithms, which operations contribute the most to the running time of the algorithm? Check all that apply.
a) Comparison of elements.
b) Swapping elements.
c) Initialization of variables.
d) Printing the output.