Advanced Higher Computing Science Practice Questions - Advanced Higher Computing Science (C816 77) Exam

Access More Questions

Which sorting algorithm has an average-case time complexity of O(n log n) and uses a divide-and-conquer recursive strategy with merging of sorted halves?

Merge sort Bubble sort Insertion sort Selection sort

Correct Answer:

Merge sort

Access more questions from this quiz

Continue to Advanced Higher Computing Science Practice Questions - Advanced Higher Computing Science (C816 77) Exam for more practice questions and the full quiz experience.

Access More Questions