{ "q02": { "type": "blank", "question": "\n\n\nGiven the following vector in C++:\n\n\n\n
`\nvector<int> v = {4, 6, 6, 3, 7, 5, 4, 7, 0, 1};\n`
\n\n\nTo sort the vector in ascending order we would do:\n\n\n
`\n____(____, ____);\n`
\n\n\nTo sort the vector in descending order we would do:\n\n\n
`\n____(____, ____);\n`
\n" }, "q03": { "type": "blank", "question": "\n\n\nGiven the same vector in question 2, what would be the output of the\nfollowing statements after sorting the vector in ascending order:\n\n\n\n
`\ncout << lower_bound(v.begin(), v.end(), 4) - v.begin() << endl; // 1. ____\ncout << upper_bound(v.begin(), v.end(), 6) - v.begin() << endl; // 2. ____\n`
\n" }, "q01": { "type": "multiple", "question": "\n\n\nSuppose we wanted to sort a million integers where each integer is between\n0 and 1,000. Which of the following statements are false?\n\n\n", "responses": { "merge_bigo": "Merge sort would order the integers in O(nlogn) time in the worst case.", "quick_bigo": "Quick sort would order the integers in O(nlogn) time in the worst case.", "insert_bigo": "Insertion sort would order the integers in O(nlogn) time in the worst case.", "count_bigo": "Counting sort would order the integers in O(nlogn) time in the worst case.", "bubble_bigo": "Bubble sort would order the integers in O(nlogn) time in the worst case." } }, "q04": { "type": "blank", "question": "\n\nComplete the following implementation of binary search in C++:\n\n\n
`\ntemplate <typename IT, typename T>\nbool binary_search(IT start, IT end, const T &target) {\n    while (____) {                  // 1\n        auto length   = ____;       // 2\n        auto middle   = ____;       // 3\n        auto midpoint = *(____);    // 4\n\n        if (____) {                 // 5\n            end   = ____;           // 6\n        } else if (____) {          // 7\n            start = ____;           // 8\n        } else {\n            return true;\n        }\n    }\n    return false;\n}\n\n`
\n" } }