About Role Algorithms and Data Structures In Problem Solving

Problem solving is an essential part of every scientific discipline. In today's world, computers are widely used to solve problems pertaining to various domain, such as banking, commerce, medicine, manufacturing, and transport. To solve a given problem by using a computer, you need to write a program for it. A program consist of two components, algorithm and data structure. Many different algorithm can be used to solve the same problem. Similarly, various types of data structures can be used to represent a problem in a computer. To solve the problem in an efficient manner, you need to select a combination of algorithm and data structure that provide maximum efficient.

Role of Algorithms
The word algorithm is derived from the name of the Persian mathematician AL Khwarizmi.

Algorithm can be defined as a step-by-step procedure for solving a problem. It helps the user arrive at the correct result in a finite number of steps. Consider the following step-by-step proceduree to display the first 10 natural numbers:
1. Set the value of counter to 1
2. Display counter
3. Increment counter by 1
4. If counter <= 10, go to step 2

The preceding step-by-step procedure is an algorithm because it produces the correct result in a finite number of steps.

An algorithm has five important properties:
1. Finiteness: An algorithm terminates after a finite number of steps
2. Definiteness: Each step in an algorithm is unambiguous. This means that the action specified by          the step cannot be interpreted in multiple ways and can be performed without any confusion.
3. Input: An algorithm accepts zero or more inputs
4. Output: An algorithm produces at least one output.
5. Effectiveness: An algorithm consist of basic instructions that are realizable. This means that the instructions can be performed by using the given inputs in a finite amount of time.