C++ algorithm that rearranges linked list based on pivot
Those -&gt; are really a standard.

You could change them to the * dereference operator but the parenthesis apocalypse it requires to make it works in larger expressions will bother you more than everything.
In a small implementation like this one it's do-able though. 

Or, you may want to write your stuff in an immutable fashion. Meaning you don't use pointers and just use return values and arguments to functions to pass values.
Without modifying them (as variables) so you never have to use pointers.