Divide and conquer is an algorithm design paradigm that solves problem by dividing it to smaller sub-problems and solving them either by dividing them to smaller ones, or by any other algorithms. This is a very old way of solving problems. However, recent technology advancements did not make it off-fashion. There are two well-known and powerful algorithms based on this methodology: Binary Search and Merge Sort. What we are going to do is, have a look at the main idea behind it, discuss about algorithms based on it, and see how we can use it in our daily projects. Continue reading →

In computer software, Algorithm is a very common term. Lots of people use this terms without even knowing the meaning or usage of them. Finding proper algorithm for a given problem could be challenging. Nowadays, hardware performance is improved a lot and this means we have faster CPUs and more memory to perform computations. This is a first article of Algorithms series, where we will discuss about algorithms and we will try to adapt the classic algorithms with our modern machines. Continue reading →