{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"boolq","formal_name":"BoolQ","introduction":"BoolQ pairs naturally occurring yes/no questions from search queries with a passage that decides them. The format is simple, but the inference it needs is consistently heavier than it looks.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://github.com/google-research-datasets/boolean-questions","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":"89a1eb9c-b802-51ad-8d5e-d0272bd38477","task_key":"default--validation--89a1eb9c-b802-51ad-8d5e-d0272bd38477","task_revision_id":"1","upstream_id":"","short_description":"is selection sort more efficient than insertion sort","config":"default","split":"validation","body":"{\"passage\":\"In computer science, selection sort is a sorting algorithm, specifically an in-place comparison sort. It has O(n) time complexity, making it inefficient on large lists, and generally performs worse than the similar insertion sort. Selection sort is noted for its simplicity, and it has performance advantages over more complicated algorithms in certain situations, particularly where auxiliary memory is limited.\",\"question\":\"is selection sort more efficient than insertion sort\"}","display_format":"text","language":"","answer_status":"published","assets":[],"source_url":"https://github.com/google-research-datasets/boolean-questions","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}