Queue: Consider the following mechanism to handle the wraparound for front. Do they all work? If so, what do you think of them as implementations?

Question

```
a. front = ( front == capacity ) ? 0 : front++;
b. front = front++ % capacity;
```

Answer 1

a. This will work, and is more elegant than the first method originally presented in the chapter.
b. This method will not work because the increment expression will be evaluated, and then front will be incremented.