What algorithm use to swap adjacent characters?

To swap adjacent characters in a string, you can use a simple iterative algorithm that processes the string two characters at a time. For each pair of characters, you can swap them and append the result to a new string. This can be done using a loop that increments the index by 2 to ensure adjacent characters are swapped. In Python, for example, you could achieve this with a list comprehension or by converting the string into a list, performing the swaps, and then joining it back into a string.