For sorting algorithms, which operations make up most of the running time of the algorithm? Check all that apply.
1) Comparison operations
2) Swapping operations
3) Accessing array elements
4) Recursive function calls