CahartcreS awppnig (Character Swapping)
Haskell, 31 bytes



f(a:b:c:d:e)=a:c:f(b:d:e)
f x=x


Try it online!

Avoids having to special-case omitting the first character by having extracting it be part of the recursive definition.