Introduction to the algorithms: sorting - part 1

Let me talk some time about what are we going to do. We basically discuss algorithms, its design, its running time (analysis) and its correctness and of course its intention or what are its applications. Informally, 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. This is the definition that i got from the text em.. this is straightforward isn't. For new people  just think this as a function containing the computational steps required to convert input to output. For designing and analyzing the algorithms, a fair knowledge of mathematics is required. I will explain as simple as possible.

As i mentioned before we will be talking about design and analysis of algorithms and if possible its correctness. The design will give you an idea of how to design an algorithm for similar form of problem and call this as the algorithm design technique. The analysis will give you the resources that the algorithm will take while its execution. There are many type of resources required while an algorithm runs in a system for example memory, its hardware, time etc. Here we are concentrating only on the time that is how fast can it execute in the system. Its correctness is very important which proves that the algorithms will execute and produce the correct output for any set of inputs. I will try to explain about this as i gets the data.

We will first start with the sorting problem.