Quick sort in C why an extra swap?

Question

I am trying to understand Quick sort algorithm and implement it in C language. I found this code in programiz;

// Quick sort in C

#include 

v