Sorting Lower Bound

import { YtQuiz } from '../js/yt-quiz.js';

Sorting Bound 1: Sorting decision trees

questions1 = [
    {
        time: "1:50",
        question: "How many different orderings?",
        answers: [
            "n",
            "n^2",
            "other"
        ],
        correct: 2
    },
    {
        time: "2:35",
        question: "How many possible distinct comparison sequences?",
        answers: [
            "k!",
            "2^k",
            "k"
        ],
        correct: 1
    },
    {
        time: "3:20",
        question: "What is a reasonable upper bound for k?",
        answers: [
            "n",
            "n^2",
        ],
        correct: 1
    },
]
yt1 = new YtQuiz("pfP_mRzuFz0", questions1);
yt1.html();

Sorting Bound 2: Proving the lower bound

questions2 = [
    {
        time: "0:05",
        question: "How many leaves as a function of n?",
        answers: [
            "n",
            "n^2",
            "n!"
        ],
        correct: 2
    },
    {
        time: "0:21",
        question: "What is the height of the tree as a function of k?",
        answers: [
            "k",
            "k lg k",
            "2^k"
        ],
        correct: 0
    },
    {
        time: "1:00",
        question: "What is the maximum number of leaves?",
        answers: [
            "2^k",
            "n",
            "n^2"
        ],
        correct: 0
    },
    {
        time: "2:05",
        question: "What is the minimum height?",
        answers: [
            "lg n",
            "lg n!",
            "other",
        ],
        correct: 1
    },
]
yt2 = new YtQuiz("b7t-t6sB16I", questions2);
yt2.html();