Efficiency of an
algorithm is very much depends on how the data are handled within the algorithm. Data can be simply
values or set of values. An algorithm takes a set of input data and then
produce another set of output data. While implementing the algorithm using programming
language, these data items should be kept within the computer memory. Data
structure provide an efficient way of organizing data within a computer memory.
It also provide a set of operations by which the manipulation of stored data can be done easily. Concepts of
several kinds of data structure are available. Any two types of data structure
differs in how they organised data and what are the operation they provided on
the stored data. One has to choose the necessary data structure useful for his
algorithm. Some basic kinds of data structures are readily available in most of
the programming languages. Based on those simple data structures, programmers
can implement other complex kinds of data structure required for their
algorithms. These requires both the concept of the data structure to be
implemented and some sort of programming skills. In this blog, we will try to
help the reader to achieve both the goals in a convenient way.
No comments:
Post a Comment