Sure, here is a simple implementation of the function in C++:

```cpp
void sort2(double* p, double* q) {
if (*p *q) {
double temp = *p;
*p = *q;
*q = temp;
}
}
```

This function works by comparing the values pointed to by `p` and `q`. If the value at `p` is greater than the value at `q`, it swaps the values. After the function call, the value at `p` will be less than or equal to the value at `q`.

Question

Sure, here is a simple implementation of the function in C++:

```cpp
void sort2(double* p, double* q) {
    if (*p > *q) {
        double temp = *p;
        *p = *q;
        *q = temp;
    }
}
```

This function works by comparing the values pointed to by `p` and `q`. If the value at `p` is greater than the value at `q`, it swaps the values. After the function call, the value at `p` will be less than or equal to the value at `q`.

Knowee AI · Accepted Answer

Sure, here is a simple implementation of the function in C++:

```cpp
void sort2(double* p, double* q) {
    if (*p > *q) {
        double temp = *p;
        *p = *q;
        *q = temp;
    }
}
```

This function works by comparing the values pointed to by `p` and `q`. If the value at `p` is greater than the value at `q`, it swaps the values. After the function call, the value at `p` will be less than or equal to the value at `q`.

Write a function void sort2(double* p, double* q) that receives two pointers and sorts the values to which they point. If you call sort2(&x, &y) then x <= y after the call.

Question

Solution

Similar Questions

Upgrade your grade with Knowee