daily pastebin goal
59%
SHARE
TWEET

Untitled

a guest Jun 23rd, 2018 54 Never
Upgrade to PRO!
ENDING IN00days00hours00mins00secs
 
  1. void Permutations::insert(int num, NodePtr smaller, NodePtr& larger)
  2. {
  3.     NodePtr prev;
  4.     NodePtr discarder;
  5.  
  6.     bool first = true;
  7.     for (/* CENSORED LOL*/)
  8.     {
  9.         // populate larger with nodes
  10.         for (/* CENSORED LOL*/)
  11.         {
  12.             // create the node
  13.  
  14.             // set the size now so we don't have to do it later
  15.  
  16.             // if this is our first node, we should make our list point to it
  17.             if (/* CENSORED LOL*/)
  18.             {
  19.  
  20.             }
  21.             // our last node should point to this node now
  22.             else
  23.  
  24.  
  25.             // we should make sure that this node points to the next node, so we save this node.
  26.  
  27.             // We have now created the node with a size and it's link, let us move on:
  28.             // create the set
  29.  
  30.             // populate the set
  31.             // copy the smaller set into the new set, but
  32.             // num should go into position i of the new set
  33.             for (/* CENSORED LOL*/)
  34.             {
  35.                 if (/* CENSORED LOL*/)
  36.  
  37.                 else if (/* CENSORED LOL*/)
  38.  
  39.                 else if (/* CENSORED LOL*/)
  40.  
  41.                 }
  42.             // assign the pointer to the perumtation node
  43.            
  44.         }
  45.     }
  46. }
RAW Paste Data
We use cookies for various purposes including analytics. By continuing to use Pastebin, you agree to our use of cookies as described in the Cookies Policy. OK, I Understand
 
Top