title: What does "cannot Convert vector<int>* to int" mean?
body: <p>I have the error:</p>
  
  <p>Error   1   error C2664: 'int practiceMergeSort(int,int,std::vector>)' :
      cannot convert argument 1 from 'std::vector> *' to 'int'</p>
  
  <p>I have no idea what may be the cause of the error or what the error is even telling me.</p>
  
  <p>EDIT:</p>
  
  <pre><code>Function Prototypes
  int practiceMergeSort(int, int, vector&lt;int&gt;);
  int practiceMerge(vector&lt;int&gt;, int, int, int);
  
  int main()
  {
      int numOfItems;
      srand(int(time(0))); // Initialize the random number generator
      printf("Algorithm Comparison\n\n");
  
      printf("Selection Sort\n");
      //selectionSort();
      practiceSelectionSort(); // Fully functioning version
  
      //------------------------------------------------------------------
      cout &lt;&lt; "\nMerge Sort\n";
  
      cout &lt;&lt; "Enter the number of items to be sorted: ";
      cin &gt;&gt; numOfItems;
  
      vector&lt;int&gt; mergeArray(numOfItems);
  
      cout &lt;&lt; "Value of numOfItems: " &lt;&lt; numOfItems &lt;&lt; "\n";
  
      cout &lt;&lt; "Array values: \n";
      for (int x = 0; x &lt; numOfItems; x++)
      {
          mergeArray[x] = rand();
          cout &lt;&lt; mergeArray[x] &lt;&lt; "\n";
      }
  
      practiceMergeSort(&amp;mergeArray, 0, numOfItems);
      //------------------------------------------------------------------
  
      // Testing of the Array Filler
      //printf("\nArray Filler\n");
      //arrayFiller();
  
      cout &lt;&lt; "\n\n";
  
      system("pause");
  
      return 0;
  }
  
  int practiceMergeSort(vector&lt;int&gt; mergeArray[], int low, int high)
  {
      if (low &lt; high) {
          int mid = (high + low) / 2;
          practiceMergeSort(mergeArray, low, mid);
          practiceMergeSort(mergeArray, mid + 1, high);
          practiceMerge(mergeArray, low, mid, high);
      }
      return 0;
  }
  
  int practiceMerge(vector&lt;int&gt; mergeArray[], int low, int mid, int high)
  {
      vector&lt;int&gt; b[10000];
      int i = low, j = mid + 1, k = 0;
  
      while (i &lt;= mid &amp;&amp; j &lt;= high) {
          if (mergeArray[i] &lt;= mergeArray[j])
              b[k++] = mergeArray[i++];
          else
              b[k++] = mergeArray[j++];
          }
      while (i &lt;= mid)
          b[k++] = mergeArray[i++];
  
      while (j &lt;= high)
          b[k++] = mergeArray[j++];
  
      k--;
      while (k &gt;= 0) {
          mergeArray[low + k] = b[k];
          k--;
      }
      return 0;
  }
  </code></pre>