benchmarks.wiki / Public workspace

MMLU / Mergesort works by splitting a list of n numbers in half, sorting each half…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

question

Mergesort works by splitting a list of n numbers in half, sorting each half recursively, and merging the two halves. Which of the following data structures will allow mergesort to work in O(n log n) time?
I. A singly linked list
II. A doubly linked list
III. An array

choices

  1. None
  2. III only
  3. I and II only
  4. I, II, and III

subject

college_computer_science

Discussion

Discussion

No discussion posts on this page yet. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

Source and history

Official source

initial import