title: Comb Sort Implementation Doesn't Accurately Sort, C++
body: <p>I attempted to implement the pseudocode for comb sort on wikipedia but it doest appear to sort the sample array I give it. Any tips?</p>
  
  <pre><code>void combSort(int* list, int length)
  {
  bool swapper;
  int gap = length;
  double shrink = 1.25;
  int temp;
  do{
      gap = (int) gap/shrink;
      if (gap &lt; 1)
          gap = 1;
  
      swapper = false;
      for (int i=0;(i+gap)&lt;length;i++){
          if (list[i] &gt; list[i+gap]){
              swap(list[i],list[i+gap]);
              swapper = true;
          }
      }
  }
  while ((gap &gt; 1) &amp;&amp; (swapper == true));
  }
  </code></pre>