COMP10002_2025_SM2 Supplementary or Special Exam: Foundations of Algorithms (COMP10002_2025_SM2) Requires Respondus LockDown Browser

Student C says: "Well, if we are allowed to change the arrays A[] and/or B[], then I can solve this problem in O(m log m + n log m) time in the worst case, which is O(n log m); and when m grows much m...