If a large dataset of employee records needs sorting by last name, which outcome is most likely using a merge sort algorithm, rather than a bubble sort?

💡 Explanation

Merge sort exhibits O(n log n) time complexity, whereas bubble sort has O(n^2). Therefore, merge sort leads to faster execution time for large datasets, because its divide-and-conquer mechanism scales more efficiently, rather than bubble sort's pairwise comparisons.

• A compiler uses induction to verify that a function correctly computes factorials. Which step validates the function's correctness for a simple, fixed input?
• An online file-sharing service uses cryptographic hash functions to verify file integrity. Which mechanism explains why detecting even a minor alteration to a stored file becomes highly probable?
• If a satellite's orientation changes, which property of its orbit remains invariant, assuming a perfectly spherical Earth and no external forces?
• Why does an automated theorem prover use Proof by Contradiction to validate a mathematical statement?
• If a set of logical statements within a formal system implies a conclusion, which term describes that the system's inference rules preserve truth?
• A university schedules final exams, aiming to minimize conflicts. What happens to the number of distinct exam slots required if a small group of students retakes multiple courses?