Data Structure

Characteristics of an Algorithm

An algorithm should have the following characteristics − Unambiguous − Algorithm should be clear and unambiguous. Each of its steps

An algorithm is a finite set of instructions or logic, written in order, to accomplish a certain predefined task. Algorithm

Data Structure can be classified in two categories. According to these categories we can access or manage data according to

1) Traversing: Every data structure contains the set of data elements. Traversing the data structure means visiting each element of

Data structure is a particular way of storing and organizing information in a computer so that it can be retrieved

Efficiency : Efficiency of a program depends upon the choice of data structures. For example: suppose, we have some data

Data Structure can be defined as the group of data elements which provides an efficient way of storing and organising