We have many problems around us which are of different types. But we want to solve these problems in an efficient and effective way. For our daily life, if you have any problem, then we find a solution to solve it. We face three phases for problem-solving in our daily life:
- Define the solution
- Analyze the solution
- Implement the solution
There is the same situation in the field of computer science. The solution we applied to solve computer problems is called an algorithm. We have to design this algorithm, then analyze it according to the business requirement, then implement this to solve the problem. The algorithm is nothing but a procedure that contains a specific set of rules to get output from input. We’ll learn the ways and techniques to analyze algorithms in this article.
Data structure is all about how to design, analyze and implement the “efficient” algorithms. So data structure is the most fundamental and building block concept in computer science to solve computer problems. It has a lot of importance in creating program logic.
Data structure is defined as,
“A way to store and organize data into the computer so that the data can be used efficiently and effectively.”
For example, in the dictionary, every word is sorted in an organized way. If the word is not sorted then it is almost impossible to find any word in the dictionary. So we have to use data structures to store and organize data in an efficient manner.
Comments
Post a Comment