{"assignment":{"_schema_version":2,"course_id":37,"date_created":"2022-06-28T19:00:00+00:00","date_modified":"2023-04-08T18:18:54.517764+00:00","extra_instructor_files":"","extra_starting_files":"","forked_id":null,"forked_version":null,"hidden":false,"id":1167,"instructions":"{\n  \"settings\": {\n    \"readingId\": \"bakery_time_sorting_read\",\n    \"attemptLimit\": -1,\n    \"coolDown\": -1,\n    \"feedbackType\": \"IMMEDIATE\",\n    \"questionsPerPage\": -1,\n    \"poolRandomness\": \"ATTEMPT\"\n  },\n  \"questions\": {\n    \"Differentiate Sorting and Searching Speed\": {\n      \"type\": \"multiple_choice_question\",\n      \"points\": 1,\n      \"body\": \"Which is faster, sorting a list of elements or searching the same list of elements?\",\n      \"answers\": [\n        \"Sorting is always faster.\",\n        \"Searching is always faster.\",\n        \"Sorting is usually faster, unless the list is already sorted and the item we search for is not in the list.\",\n        \"Searching is usually faster, unless the list is already sorted and the item we search for is not in the list.\"\n      ]\n    },\n    \"Actual Values Affect Runtime\": {\n      \"type\": \"true_false_question\",\n      \"points\": 1,\n      \"body\": \"True or False: time that an algorithm takes is always dependent on the size of the input, not on the actual values of the input.\"\n    },\n    \"Binary Search on Unsorted List\": {\n      \"type\": \"true_false_question\",\n      \"points\": 1,\n      \"body\": \"True or False: binary search would not work on an unsorted list of numbers.\"\n    },\n    \"Binary Search on Strings\": {\n      \"type\": \"true_false_question\",\n      \"points\": 1,\n      \"body\": \"True or False: binary search only works on numbers, because you cannot order strings.\"\n    },\n    \"Binary Search vs Iterative Search Speed\": {\n      \"type\": \"multiple_choice_question\",\n      \"points\": 1,\n      \"body\": \"Why is binary search faster than iterative search?\",\n      \"answers\": [\n        \"Binary search uses binary numbers, which are faster than regular numbers.\",\n        \"Binary search repeatedly divides the search space in half each time.\",\n        \"Binary search uses ancient forbidden magic taught to us by the elder gods.\",\n        \"Binary search uses the RAM Model to estimate where the item is before seeking it.\",\n        \"Binary search alternates between checking the first and last elements, moving inwards, finding the value in half the time.\",\n        \"Nobody knows. The secret is lost to time.\"\n      ]\n    },\n    \"Counting Search Checks\": {\n      \"type\": \"matching_question\",\n      \"points\": 2,\n      \"body\": \"Each time a search algorithm considers a possible item in a list, that is considered a \\\"check\\\".\",\n      \"answers\": [\n        \"0 checks\",\n        \"1 check\",\n        \"2 checks\",\n        \"6 checks\",\n        \"10 checks\",\n        \"100 checks\"\n      ],\n      \"statements\": [\n        \"In the best case, how many checks would iterative search need to find an item in a list of 100 numbers?\",\n        \"In the worst case, how many checks would iterative search need to find an item in a list of 100 numbers?\",\n        \"In the best case, how many checks would binary search need to find an item in a list of 100 numbers?\",\n        \"In the worst case, how many checks would binary search need to find an item in a list of 100 numbers?\"\n      ]\n    },\n    \"Describe Insertion Sort\": {\n      \"type\": \"multiple_choice_question\",\n      \"points\": 1,\n      \"body\": \"Which of the following is an accurate summary of Insertion Sort?\\n\\nWe recommend you check out this page: <https://visualgo.net/en/sorting>\",\n      \"answers\": [\n        \"Repeatedly find the smallest element in the rest of the list and move it to the front of the list.\",\n        \"Walk through each position of the list, and move the current element into the earlier position in the list where it belongs.\",\n        \"Swap each pair of elements repeatedly until all the elements are in the proper order.\",\n        \"Repeatedly divide the list into two halves, sort each half, and then merge them back together.\",\n        \"Repeatedly shuffle the list until the list is in sorted order.\"\n      ]\n    },\n    \"The Importance of Sorting and Searching\": {\n      \"type\": \"multiple_answers_question\",\n      \"points\": 1,\n      \"body\": \"Which of the following are valid reasons that Computer Scientists study sorting and searching so much?\",\n      \"answers\": [\n        \"Searching and sorting are common problems for lists.\",\n        \"Both searching and sorting have been studied closely, so they are well-understood.\",\n        \"Programmers often need to make their own sorting and search algorithms, since most languages do not have their own implementation built-in to the language.\",\n        \"Sorting and searching are very complicated problems, so studying them makes us feel smarter and superior to other disciplines.\"\n      ]\n    }\n  },\n  \"pools\": []\n}","ip_ranges":"","name":"11A2) Sorting","on_change":"","on_eval":"","on_run":"","owner_id":1,"owner_id__email":"acbart@udel.edu","points":1,"public":true,"reviewed":false,"sample_submissions":[],"settings":"","starting_code":"","subordinate":false,"tags":[],"type":"quiz","url":"bakery_time_sorting_quiz","version":5},"ip":"216.73.216.157","submission":{"_schema_version":3,"assignment_id":1167,"assignment_version":5,"attempts":0,"code":"","correct":false,"course_id":37,"date_created":"2026-05-20T14:01:44.892241+00:00","date_due":"","date_graded":"","date_locked":"","date_modified":"2026-05-20T14:01:44.892241+00:00","date_started":"","date_submitted":"","endpoint":"","extra_files":"","feedback":"","grading_status":"NotReady","id":2036909,"score":0.0,"submission_status":"Started","time_limit":"","url":"submission_url-6091a6b4-06da-40cd-8036-bf298cf254a9","user_id":2044668,"user_id__email":"","version":0},"success":true}