divide and conquer sorting algorithm code example
Example: divide and conquer algorithm
divide and conquer:
split the problem into sub problems,
solve each sub problem to eventually solve the main problem
divide and conquer:
split the problem into sub problems,
solve each sub problem to eventually solve the main problem