Recursive vs non-recursive sorting algorithms

Question

Can someone explain in English how non-recursive and recursive implementations of sorting algorithms differs from each other?

Answer 1

How they differ, in what sense? Bear in mind: any recursive algorithm can be implemented as an iterative algorithm, and vice versa (take a look at this post). Iteration or recursion - it's just an implementation detail; although it can have a major impact in performance depending on the choice, the algorithm will be the same nevertheless.