Important Points

1. Data structure is logical and mathematical view of any organization data.
2. Compound data structure can formed by combining two or more data structure in various ways.
3. Algorithm is a finite set of instruction or logics which is  written for completing a predefined task.
4. Space Complexity is memory required during the execution of algorithm. For multiuser system, when limited memory is available, than it should be taken seriously.

---

Introduction of Data Structure

Data structure is a method to and organised data so that we can do operation on data effectively. Data structure are used the arrange and storage of data. Data structure is the logical and mathmatical view of data if any Organization. For example- Name and age of a player is Virat, 26 yrs. As data. Here, Name(Virat) is a string data type and 26 is integer data. We  can arrange this data as a players record. Now we can store player record in a file or database as data structure for example- Dhoni-30, Sachin-36, Sehwag-33

 

^{Classification of Data structure}

Simple Data Structure - These are generally formed by primitives data types like - Integers, Real, Character, Boolean. Simple data structure two types-

1. Array
2. Structure

Compound Data Structure - Compound data structure are formed by combining two or more simple data structure in various way. These of types-

1. Linear data structure - These are singal level data structure, its element forms a sequence so it is called as linear data structure.

Types of it are -

1. Stack
2. Queue
3. Link list

        2. Non Linear Data Structure - These are multi level data structure. Example of multi level data structure are Tree and Graph

Operation on data structure - 

• Insertion -  It means adding a new element in data structure.

• Deletion - Deletion means removing an element from data structure if it exist.

• Search - To find any instructed data elements in data structure is know as search.

• Traversing - Processing on all existing data element is called as traversing.

• Sorting - Arranging of data element is specific order is called sorting.

• Merging - Combining of two some type of data structure and formatting a new data structure by it, called merging.

Algorithm  - Algorithm is a finite set of logics and instructions which is written to complete predefined task. Algorithm is not whole code or program, it is only the solution (logic) to problem. It can be represented by pseudocode or flowchart as informal high level description. 

If any Algorithm takes less time and memory in execution, than it is called as efficient and last algorithm. Representation of an algorithm is measured by following features -

• Space Complexity
• Time Complexity

Space  Complexity - Space complexity means memory required during the algorithm execution. For multiuser system , when limited memory is available, than it should be seriously. Generally, memory is required for the following components of an algorithm.

1. Insertion Space - Memory space required to store executable code during processing program. This space is fixed or definite which depends upon number of lines in coding.
2. Data Space - It is used to store value of variables and constants.

Time complexity - 

It is a method to represent required time for complete excecution of a program.Time complexity of algorithm is displays by Big O notation generally. Time Complexity is calculate by counting of primary function used in algorithm. Wrost caste of time complexity is used algoritm because of working capability of algorithm is different with different-different type of data. It is the maximum time used in input for algorithm.