ABSTRACT
The advantages of recursion over iteration, such as code clarity or avoiding managing a stack explicitly, are mainly due to the possibility of using multiple recursion. In some references the term "divide and conquer" is also applied to algorithms where the decomposition is based on a single subproblem of half the size of the original's. Sorting a general list is one of the most studied problems in computer science. It can be solved by numerous algorithms that can be used to introduce essential concepts related to computational complexity and runtime analysis, algorithm design paradigms, or data structures. Merge sort is one of the most extensively used examples to show the potential of the divide and conquer approach. Skyline problem consists of finding the outline of a set of rectangular buildings against the sky. The skyline merging problem is a new computational problem in its own right.
