title: RoundRobin algorithm with queue
body: <p>I have a question about roundrobin algorithm with queue and I am new with data structures. The algorithm should make this:</p>
  
  <ul>
  <li>we get 3 numbers like <code>(12 5 8)</code>  and one quantum number for example <code>q:10</code></li>
  <li><p>Then algorithm should make this :</p>
  
  <pre><code>step1: 12 5 18
  step2: 5 18 2
  step3: 18 2
  step4: 2 8
  step5: 8
  step6: array is empty
  </code></pre></li>
  </ul>
  
  <p>As you see when quantum number is equal or bigger than array's number, we will delete first number in array. when quantum number is smaller than our number ,then quantum-number <code>(12-10=2)</code> will  be added to the end of the array.</p>
  
  <p>Can someone help me ?</p>