benchmarks.wiki / Public workspace

MMLU-Pro / 10515 / A large list of numbers is to be sorted into ascending order. Assuming that a…

Problem

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

question

A large list of numbers is to be sorted into ascending order. Assuming that a “data movement” is a swap or reassignment of an element, which of the following is a true statement?

category

computer science

options

  1. If the array is initially sorted in ascending order, then selection sort will be more efficient than insertion sort.
  2. The number of comparisons for selection sort depends on the initial arrangement of elements.
  3. The number of data movements in selection sort depends on the initial arrangement of elements.
  4. The number of comparisons for bubble sort is independent of the initial arrangement of elements.
  5. The number of data movements in bubble sort is independent of the initial arrangement of elements.
  6. The number of comparisons for insertion sort is independent of the initial arrangement of elements.
  7. The number of comparisons for selection sort is independent of the initial arrangement of elements.
  8. If the array is initially sorted in descending order, then insertion sort will be more efficient than selection sort.

src

ori_mmlu-high_school_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