benchmarks.wiki / Public workspace

MMLU / Of the following sorting algorithms, which has a running time that is LEAST…

Problem

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

question

Of the following sorting algorithms, which has a running time that is LEAST dependent on the initial ordering of the input?

choices

  1. Insertion sort
  2. Quicksort
  3. Merge sort
  4. Selection sort

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