title: C++ Recursive Sorting by Divide and Conquer & Iterative sorting
body: <p>Could you guys please explain to me, in layman's terms, with or without code examples, how divide and conquer array sorting using recursion works, and how it's different than iterative array sorting? I am completely lost here. </p>