Divide-and-conquer is a style of solving problems that is not at all limited to computer science problems. It’s the idea of solving a problem in a recursive manner, or breaking a bigger problem down into smaller subproblems that can be solved more easily. There are three parts to it including…

As you may know, a Binary Search Tree of height, h, is able to support any basic dynamic-set operations…

Building a simple collision detection application in Java was a lot more work than I thought it would be. In fact, this is all that the final product looks like: