std :: string {aka std :: basic_string <char> 分配给&#39;&#39;&#39;char *&#39;

Question

tried to open a .cpp in code::blocks. Got few lines of error

Partial code :

void QSort(string List[], int Left, int Right)
{
  int i, j;
  char *x;
  string TEMP;

  i = Left;
  j = Right;
  x = List[(Left+Right)/2];

  do {
    while((strcmp(List[i],x) < 0) && (i < Right)) {
       i++;
    }
    while((strcmp(List[j],x) > 0) && (j > Left)) {
        j--;
    }
    if(i <= j) {
      strcpy(TEMP, List[i]);
      strcpy(List[i], List[j]);
      strcpy(List[j], TEMP);
      i++;
      j--;
   }
  } while(i <= j);

  if(Left < j) {
     QSort(List, Left, j);
  }
  if(i < Right) {
     QSort(List, i, Right);
  }
}

I recieve this error in line

 x = List[(Left+Right)/2];

cannot convert 'std::string {aka std::basic_string}' to 'char*' in assignment|

Answer 1

Because they're incompatible. You need to call a member of std::string which returns a const char* .

x = List[(Left+Right)/2].c_str();

Be aware: this pointer is only valid for the life time of the std::string or until you modify the string object.

This function returns a const char* so you'll need to change the definition of x from char* to `const char*.

const char* x;

or better still, remove that line, and combine the two

void QSort(string List[], int Left, int Right)
{
    string TEMP;

    int i = Left;
    int j = Right;
    const char* x = List[(Left+Right)/2];

Infact, here's a rewrite that uses standard C++ algorithms throughout (std::string::compare instead of strcmp). This may make it easier for you to focus on the algorithm itself.

void QSort(string List[], int Left, int Right)
{
    int i = Left;
    int j = Right;
    const int mid = (Left+Right) / 2;

    for (;;) // repeat until we break.
    {
        // write both comparisons in terms of operator <
        while (List[i].compare(List[mid]) < 0 && i < Right)
            ++i;
        while (List[mid].compare(List[j]) < 0 && Left < j)
            --j;
        // if i == j then we reached an impasse.
        if (i >= j)
            break;
        std::swap(List[i], List[j]);
    }

  if(Left < j)
    QSort(List, Left, j);

  if(i < Right)
    QSort(List, i, Right);
}