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.

• If Alice sends Bob an encrypted message using RSA, which consequence directly follows from the properties of modular exponentiation?
• A rubber sheet, initially a square, undergoes continuous deformation. Which outcome always maintains topological equivalence with the original square?
• A cryptographic system relies on prime numbers exceeding 2^512. If a computationally weak random number generator occasionally produces composite numbers, which consequence follows?
• If a robot arm planning a sequence of movements encounters a joint angle limit during trajectory generation, which consequence follows when using a backtracking algorithm?
• If you distribute 7 identical apples among 3 distinct children, which counting method accounts for overcounting when using stars and bars?
• If a cryptographic key generation algorithm relies heavily on multiplying very large prime numbers, which security risk increases most if the primes are too close in magnitude?