This repo represents all we learned and are learning in Data Structure course which is based on CLRS book and is being presented by Dr. Ali Katanforoush.
According to CLRS, an algorithm is any well-defined computational procedure that takes some value, or set of values, as input and produces some value, or set of values, as output.
An algorithm is thus a sequence of computational steps that transform the input into the output.
Every little task in real life that contains some arranging or keeping some orders has a kind of sorting problem in it. For instance if you're a teacher and you want to have a list of your students in an the order of their grades in exams, you need an algorithm to sort them. more...
Divide and Conquer approach is basically a recursive method to solve some important problems like Sorting problem. Here you can see more about this approach.
Elementary Data structures are the simplest kinds of dynamic sets. They give you first visions of how to implement a data structure in real world. Read more in its own section ...