Topic: Divide And Conquer Problem / Level: intermediate

Problem: Use divide and conquer to solve the problem of finding the k-th smallest element in an unsorted array.

Run the code to see the output here...