Computer Science – Dynamic Programming

Introduction Dynamic Programming is basically used to resolve problems by dividing them into sub-problems. You will begin with the smallest first and then continue with bigger ones. It has been introduced by Richard Bellman in the 50s. When should we use it ? When we have optimal structure and overlapping subproblems : Example with Fibonacci sequence …

Computer Science – Dynamic Programming Read More »

Computer Science – Search Algorithms

In computer science, a search algorithm is any algorithm which solves the search problem, namely, to retrieve information stored within some data structure. In this article we will take a look at two simple search algorithms. Linear search How it works ? The easiest search algorithm you can imagine ! Also known as sequential search this is a method for finding an element …

Computer Science – Search Algorithms Read More »

Computer Science : Sort Algorithms

Introduction In mathematics and computer science, an algorithm is an unambiguous specification of how to solve a class of problems. Algorithms can perform calculation, data processing, and automated reasoning tasks. Some algorithms are better than others even if they produce equal results. Generally, the fewer steps it takes to compute, the better it is. But sometimes we care …

Computer Science : Sort Algorithms Read More »