questions1 = [ {time:"2:31",question:"What is the worst case running time of Insertion Sort?",answers: ["O(n)","O(n^2)","O(n log n)", ],correct:1, }]yt1 =newYtQuiz("ttTs4AHStPI", questions1);
Merge Sort 2: Recurrence Equations
questions2 = [ {time:"2:42",question:"How would you note the running time of each recursive call?",answers: ["I am not providing options. Please think about possibilities before pushing continue." ],correct:0, }]yt2 =newYtQuiz("okbWe2g89KY", questions2);
Merge Sort 3: Divide and Conquer
Merge Sort 4: Merge
Merge Sort 5: Merge Running Time
Merge Sort 6: Merge Sort Recursion Tree
questions6 = [ {time:"3:26",question:"What is the bottom-most level?",answers: ["n","n/2","lg n", ],correct:2, }]yt6 =newYtQuiz("m5_M2n_vzOE", questions6);