{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"mmlu","formal_name":"MMLU","introduction":"MMLU asks four-way multiple-choice questions across 57 subjects, from elementary material to professional-level examinations. Since 2020 it has been the most widely cited single reference point for general capability.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://github.com/hendrycks/test","indexing_mode":"index","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[],"history":"","construction":"","limitations":"","saturation":"","scores":[]}},"task_id":"38f0d1c3-effc-54ee-96e5-dbef253f468e","task_key":"all--test--38f0d1c3-effc-54ee-96e5-dbef253f468e","task_revision_id":"1","upstream_id":"","short_description":"Which of the following algorithms has running time Θ(n^2) in the worst case but…","config":"all","split":"test","body":"{\"choices\":\"['Bubblesort', 'Mergesort', 'Heapsort', 'Quicksort']\",\"question\":\"Which of the following algorithms has running time Θ(n^2) in the worst case but Θ(n log n) on average?\",\"subject\":\"college_computer_science\"}","display_format":"text","language":"","answer_status":"published","assets":[],"source_url":"https://github.com/hendrycks/test","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}