void Permutations::insert(int num, NodePtr smaller, NodePtr& larger)
{
    NodePtr prev;
    NodePtr discarder;

    bool first = true;
    for (/* CENSORED LOL*/)
    {
        // populate larger with nodes
        for (/* CENSORED LOL*/)
        {
            // create the node

            // set the size now so we don't have to do it later

            // if this is our first node, we should make our list point to it
            if (/* CENSORED LOL*/)
            {

            }
            // our last node should point to this node now
            else


            // we should make sure that this node points to the next node, so we save this node.

            // We have now created the node with a size and it's link, let us move on:
            // create the set

            // populate the set
            // copy the smaller set into the new set, but
            // num should go into position i of the new set
            for (/* CENSORED LOL*/)
            {
                if (/* CENSORED LOL*/)

                else if (/* CENSORED LOL*/)

                else if (/* CENSORED LOL*/)

                }
            // assign the pointer to the perumtation node

        }
    }
}