Inserting an element in a sorted array using traditional algorithm
2 likes377 views
The document describes the process of inserting an element (80) into a sorted array using a traditional algorithm. It details the steps taken to find the appropriate position for the new element and the resulting structure of the array after insertion. The final array after the insertion is noted as [10, 20, 30, 40, 50, 60, 70, 80].
![GVK Chinmaya Vidyalaya
Explanation:
item=80
10 20 30 40 50 60 70
80<ar[0]
False
pos=-1
10 20 30 40 50 60 70
i = 0 ar[0]<=80 and 80<=ar[1]
False
10 20 30 40 50 60 70
i = 1 ar[ 1 ] <= 80 and 80 <= ar[ 2 ]
False
C. Vijaya Kumar
B.Tech,MBA](https://image.slidesharecdn.com/insertinganelementinasortedarrayusingtraditionalalgorithm-200910153413/85/Inserting-an-element-in-a-sorted-array-using-traditional-algorithm-2-320.jpg)
![GVK Chinmaya Vidyalaya
10 20 30 40 50 60 70
i = 2 ar [2]<= 80 and 80 <=ar[3]
False
10 20 30 40 50 60 70
i = 3 ar[3]<=80 and 80<=ar[4]
False
10 20 30 40 50 60 70
i = 4 ar[4]<=80 and 80<=ar[5]
False
10 20 30 40 50 60 70
i = 5 ar[5]<=80 and 80<=ar[6]
False
10 20 30 40 50 60 70
i = 6 while condition False
C. Vijaya Kumar
B.Tech,MBA](https://image.slidesharecdn.com/insertinganelementinasortedarrayusingtraditionalalgorithm-200910153413/85/Inserting-an-element-in-a-sorted-array-using-traditional-algorithm-3-320.jpg)
![GVK Chinmaya Vidyalaya
If (pos==-1 and i<=size-1): True and True
Pos = 7
return pos
ar=[10, 20, 30, 40, 50, 60, 70]
pos = 7
ar.append(None)
10 20 30 40 50 60 70 None
Size = 8
i = 7
While 7>=7:
ar[ 7 ] = ar[ 6 ]
i = 6
10 20 30 40 50 60 70 70
While 6>=7: False
mylist [ 7 ] = 80
10 20 30 40 50 60 70 80
C. Vijaya Kumar
B.Tech,MBA](https://image.slidesharecdn.com/insertinganelementinasortedarrayusingtraditionalalgorithm-200910153413/85/Inserting-an-element-in-a-sorted-array-using-traditional-algorithm-4-320.jpg)
Inserting an element in a sorted array using traditional algorithm
- 1. GVK Chinmaya Vidyalaya Inserting an element in a sorted array using traditional algorithm Approach 1: C. Vijaya Kumar B.Tech,MBA
- 2. GVK Chinmaya Vidyalaya Explanation: item=80 10 20 30 40 50 60 70 80<ar[0] False pos=-1 10 20 30 40 50 60 70 i = 0 ar[0]<=80 and 80<=ar[1] False 10 20 30 40 50 60 70 i = 1 ar[ 1 ] <= 80 and 80 <= ar[ 2 ] False C. Vijaya Kumar B.Tech,MBA
- 3. GVK Chinmaya Vidyalaya 10 20 30 40 50 60 70 i = 2 ar [2]<= 80 and 80 <=ar[3] False 10 20 30 40 50 60 70 i = 3 ar[3]<=80 and 80<=ar[4] False 10 20 30 40 50 60 70 i = 4 ar[4]<=80 and 80<=ar[5] False 10 20 30 40 50 60 70 i = 5 ar[5]<=80 and 80<=ar[6] False 10 20 30 40 50 60 70 i = 6 while condition False C. Vijaya Kumar B.Tech,MBA
- 4. GVK Chinmaya Vidyalaya If (pos==-1 and i<=size-1): True and True Pos = 7 return pos ar=[10, 20, 30, 40, 50, 60, 70] pos = 7 ar.append(None) 10 20 30 40 50 60 70 None Size = 8 i = 7 While 7>=7: ar[ 7 ] = ar[ 6 ] i = 6 10 20 30 40 50 60 70 70 While 6>=7: False mylist [ 7 ] = 80 10 20 30 40 50 60 70 80 C. Vijaya Kumar B.Tech,MBA