Download to read offline
![Extra:2) Application Level:Array:Source code adding on a thing.
Homogeneous
Sequential order
Not Flexible (Fix)
3) Implementation Level:Executable code adding on a thing.
Link-List:-
Bubble Sort:-
NonHomogeneous
Non-Sequential
Flexible
Step 1
2
2
2
2
2
2
2
2
Step 2
9
9
4
4
4
4
4
4
2
2
2
2
2
2
Step 3
4
4
9
1
1
1
1
1
4
1
1
1
1
1
2
1
1
2
1
2
1
2
1
2
1
2
1
2
Logical method:while(a[i]>a[i+1]){
//Swaping;a=b
1
1
1
9
5
5
5
5
5
5
5
5
9
6
6
6
6
6
6
6
6
9
7
7
7
7
7
7
7
7
9
8
8
8
8
8
8
8
8
9
1
4
4
4
4
4
5
5
5
5
5
5
6
6
6
6
6
6
7
7
7
7
7
7
8
8
8
8
8
8
9
9
9
9
9
9
4
4
4
4
4
4
4
5
5
5
5
5
5
5
6
6
6
6
6
6
6
7
7
7
7
7
7
7
8
8
8
8
8
8
8
9
9
9
9
9
9
9](https://image.slidesharecdn.com/datastructuresandalgorithm-140206005218-phpapp01/75/Data-structures-and-algorithm-2-2048.jpg)
![Extra:2) Application Level:Array:Source code adding on a thing.
Homogeneous
Sequential order
Not Flexible (Fix)
3) Implementation Level:Executable code adding on a thing.
Link-List:-
Bubble Sort:-
NonHomogeneous
Non-Sequential
Flexible
Step 1
2
2
2
2
2
2
2
2
Step 2
9
9
4
4
4
4
4
4
2
2
2
2
2
2
Step 3
4
4
9
1
1
1
1
1
4
1
1
1
1
1
2
1
1
2
1
2
1
2
1
2
1
2
1
2
Logical method:while(a[i]>a[i+1]){
//Swaping;a=b
1
1
1
9
5
5
5
5
5
5
5
5
9
6
6
6
6
6
6
6
6
9
7
7
7
7
7
7
7
7
9
8
8
8
8
8
8
8
8
9
1
4
4
4
4
4
5
5
5
5
5
5
6
6
6
6
6
6
7
7
7
7
7
7
8
8
8
8
8
8
9
9
9
9
9
9
4
4
4
4
4
4
4
5
5
5
5
5
5
5
6
6
6
6
6
6
6
7
7
7
7
7
7
7
8
8
8
8
8
8
8
9
9
9
9
9
9
9](https://crownmelresort.com/image.slidesharecdn.com/datastructuresandalgorithm-140206005218-phpapp01/75/Data-structures-and-algorithm-2-2048.jpg)
Uploaded byMuhammad Aamir Rakhshani
Data structures and algorithm
This document discusses data structures and algorithms. It defines data structures as the arrangement of data in memory and lists examples like arrays, queues, trees and graphs. Algorithms are defined as a set of instructions. The document discusses different types of data structures including physical and logical structures, as well as linear and non-linear structures. It also discusses different levels of data structures from the abstract to application to implementation levels. Examples of specific data structures like arrays and linked lists are provided along with descriptions of their characteristics. The bubble sort algorithm is also explained through steps.
More Related Content
Similar to Data structures and algorithm
Data structures and algorithm
- 1. Lectures of DataStructures and Algorithm 08-Oct-13 Definition of Data Structure and Algorithm:The arrangement/manipulation of data by the compiler in computer memory. Types of Data Structure:1. Physical Data Structure 2. Logical Data Structure Examples of Data Structure:1. 2. 3. 4. 5. 6. Stat Queue => De-Queues Array Graph Sorting Tree *Physical DS:-. Physical memory of data by the translator. *Logical DS:Logical concept of data by the translator. 09-Oct-13 Types of Data Structure:1) Physical Data Structure:a) Linear Physical Data Structure(e.g. Array , Queue , Stat) b) Non-Linear Physical Data Structure(e.g. Link list, Tree, Graph) 2) Logical Data Structure:a) Linear Logical Data Structure b) Non-Linear Logical Data Structure Levels of Data Structure:Abstract Level Application Level Implementation Level 1) Abstract Level:In abstract way….. (sarsari tor per)
- 2. Extra:2) Application Level:Array:Sourcecode adding on a thing. Homogeneous Sequential order Not Flexible (Fix) 3) Implementation Level:Executable code adding on a thing. Link-List:- Bubble Sort:- NonHomogeneous Non-Sequential Flexible Step 1 2 2 2 2 2 2 2 2 Step 2 9 9 4 4 4 4 4 4 2 2 2 2 2 2 Step 3 4 4 9 1 1 1 1 1 4 1 1 1 1 1 2 1 1 2 1 2 1 2 1 2 1 2 1 2 Logical method:while(a[i]>a[i+1]){ //Swaping;a=b 1 1 1 9 5 5 5 5 5 5 5 5 9 6 6 6 6 6 6 6 6 9 7 7 7 7 7 7 7 7 9 8 8 8 8 8 8 8 8 9 1 4 4 4 4 4 5 5 5 5 5 5 6 6 6 6 6 6 7 7 7 7 7 7 8 8 8 8 8 8 9 9 9 9 9 9 4 4 4 4 4 4 4 5 5 5 5 5 5 5 6 6 6 6 6 6 6 7 7 7 7 7 7 7 8 8 8 8 8 8 8 9 9 9 9 9 9 9
- 3. b=c c=a } Definition of Algorithm:Setof instructions is called Algorithm. OR Non-executable code is called Algorithm. It don’t have “;” or other statement ending words.