sorting techniques - govardhan satish
TRANSCRIPT
MR. GOVERDHAN SATISH K.V, PGT CS, KV AFS, YELAHANKA , BANGALORE
MR. GOVERDHAN SATISH K.VPGT CS
KV AFS , YELAHANKA BANGALORE REGION
MR. GOVERDHAN SATISH K.V, PGT CS, KV AFS, YELAHANKA , BANGALORE
ACTIVITY – Assembly
I request 4 friends to come on dice and stand besides each other in height wise.
I call upon 2 more friends to come.
MR. GOVERDHAN SATISH K.V, PGT CS, KV AFS, YELAHANKA , BANGALORE
INSERTION SORT
BUBBLE SORT
The basic idea of bubble sort is to compare two adjoining values and
exchange them if they are not in proper order.
EXAMPLE- the following unsorted array is to be sorted in ascending order using
bubble sort.
MR. GOVERDHAN SATISH K.V, PGT CS, KV AFS, YELAHANKA , BANGALORE
14
25 5 1
8 3
14 5 2
518 3
No Change
SWAP
14
25 5 1
8 3
SWAP
14 5 1
825 3
SWAP
MR. GOVERDHAN SATISH K.V, PGT CS, KV AFS, YELAHANKA , BANGALORE
3 5 14
18
25
5 3 14
18
25
SWAP
SORTED ARRAY
No Change
No Change
No Change
MR. GOVERDHAN SATISH K.V, PGT CS, KV AFS, YELAHANKA , BANGALORE
SELECTION SORT• Its basic idea is to repeatedly
select the smallest key and place in order.
• Example- The following array is to be sorted in ascending order using selection sort.
MR. GOVERDHAN SATISH K.V, PGT CS, KV AFS, YELAHANKA , BANGALORE
MR. GOVERDHAN SATISH K.V, PGT CS, KV AFS, YELAHANKA , BANGALORE
16 7 14 23 4 53 3
3 7 14 23 4 53 16
Smallest
Interchange the Element
Smallest
Interchange the Element
MR. GOVERDHAN SATISH K.V, PGT CS, KV AFS, YELAHANKA , BANGALORE
3 4 14 23 7 53 16
3 4 7 23 14 53 16
SmallestInterchange the Element
Interchange the Element Smallest
MR. GOVERDHAN SATISH K.V, PGT CS, KV AFS, YELAHANKA , BANGALORE
3 4 7 14 23 53 16
3 4 7 14 16 53 23
Smallest
SmallestInterchange the Element
Interchange the Element LARGES
T
THE ARRAY IS SORTED IN ASCENDING ORDER USING SELECTION SORT
MR. GOVERDHAN SATISH K.V, PGT CS, KV AFS, YELAHANKA , BANGALORE
MR. GOVERDHAN SATISH K.V, PGT CS, KV AFS, YELAHANKA , BANGALORE
SORTED ARRAY
3 4 7 14 16 23 53
MR. GOVERDHAN SATISH K.V, PGT CS, KV AFS, YELAHANKA , BANGALORE
INSERTION SORT
MR. GOVERDHAN SATISH K.V, PGT CS, KV AFS, YELAHANKA , BANGALORE
OBJECTIVE
• Understand how insertion sort works.• Mastering nested loops• Reasoning ability• Mastering 1D array(modify,insert)• Conceptualizing to real world
MR. GOVERDHAN SATISH K.V, PGT CS, KV AFS, YELAHANKA , BANGALORE
Insertion Sort Start with a sorted list of 1 element on the left, and N-1 unsorted items on the right.
Take the first unsorted item (element #2) and insert it into the sorted list, moving elements as necessary.
We now have a sorted list of size 2, and N -2 unsorted elements. Repeat for all elements.
MR. GOVERDHAN SATISH K.V, PGT CS, KV AFS, YELAHANKA , BANGALORE
Example- Lets enter some random elements.
11 215 3
54
Now lets try to sort array is using insertion sort.
MR. GOVERDHAN SATISH K.V, PGT CS, KV AFS, YELAHANKA , BANGALORE
11 215 3
54
5 2111
354
As 5 is smaller than 11. the element 5 is to be inserted before 11Therefore it moves to the left.
5
4
As 4 is smaller than 5 and 11. Therefore the element 4 is to be inserted before 5.
5
4
MR. GOVERDHAN SATISH K.V, PGT CS, KV AFS, YELAHANKA , BANGALORE
4 215 35
11
1 2114 3
55
As 1 is smaller than 10,5, and 4. Therefore it is inserted before the element 4.
As 35 is greater than 10 , the first element to the left . No change in the list happens. Therefore it maintains its position.
1
1
35
MR. GOVERDHAN SATISH K.V, PGT CS, KV AFS, YELAHANKA , BANGALORE
1 2114 3
55
As 2 is smaller than 35, 10, 5, and 4, but greater than 1. Therefore the element 2 is inserted between 4 and 1.
. 2
SORTED ARRAY
1 1152 3
54
MR. GOVERDHAN SATISH K.V, PGT CS, KV AFS, YELAHANKA , BANGALORE
MR. GOVERDHAN SATISH K.V, PGT CS, KV AFS, YELAHANKA , BANGALORE
IMPLEMENTATION
MR. GOVERDHAN SATISH K.V, PGT CS, KV AFS, YELAHANKA , BANGALORE
MR. GOVERDHAN SATISH K.V, PGT CS, KV AFS, YELAHANKA , BANGALORE
1 2114 3
55
As 2 is smaller than 35, 10, 5, and 4, but greater than 1.
Therefore the element 2 is to be inserted between 4 and 1.
2
0 1 2 3 4 5
MR. GOVERDHAN SATISH K.V, PGT CS, KV AFS, YELAHANKA , BANGALORE
How to insert the element 2 into sorted listkey = a[5];
for(j = 4 ;j>=0; j--){
if(key < a[j])a[j+1] = a[j]
elsebreak;
}
a[j+1] = key;
MR. GOVERDHAN SATISH K.V, PGT CS, KV AFS, YELAHANKA , BANGALORE
Insertion sort - functionvoid insertion_sort(int a[100], int n){
for(int i = 1; i<n; i++ ){
key = a[i];for(int j=i-1 ; j>=0; j--){
if(key < a[j])a[j+1] = a[j]
elsebreak;
}a[j+1] = key;display(a,n);
}} MR. GOVERDHAN SATISH K.V, PGT CS, KV AFS, YELAHANKA , BANGALORE
MR. GOVERDHAN SATISH K.V, PGT CS, KV AFS, YELAHANKA , BANGALORE
MR. GOVERDHAN SATISH K.V, PGT CS, KV AFS, YELAHANKA , BANGALORE
Questionnaire
• Name any two applications of insertion sort.• Is there any other way we can implement
insertion sort.
MR. GOVERDHAN SATISH K.V, PGT CS, KV AFS, YELAHANKA , BANGALORE
MR. GOVERDHAN SATISH K.V, PGT CS, KV AFS, YELAHANKA , BANGALORE