Sorting Techniques - Govardhan Satish

MR. GOVERDHAN SATISH K.V
PGT CS
KV AFS , YELAHANKA
BANGALORE REGIONMR. 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
MR. GOVERDHAN SATISH K.V, PGT CS, KV AFS, YELAHANKA , BANGALORE
INSERTIONSORT

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.

1
4
2
5
5
1
8
3
1
4
5
2
5
1
8
3
No
Change
SWAP
1
4
2
5
5
1
8
3
SWAP
1
4
5
1
8
2
5
3
SWAP

3 5 14 18 25
5 3 14 18 25
SWA
P
SORTED
ARRAY
No
Change
No
Change
No
Change

SELECTIONSORT
• 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.

16 7 14 23 4 53 3
3 7 14 23 4 53 16
Smalles
t
Interchange the
Element
Smallest
Interchange the
Element

3 4 14 23 7 53 16
3 4 7 23 14 53 16
SmallestInterchange the
Element
Interchange the
Element Smallest

3 4 7 14 23 53 16
3 4 7 14 16 53 23
Smallest
Smallest
Interchange the
Element
Interchange the
Element LARGES
T
THE ARRAY IS SORTED IN ASCENDING ORDER USING SELECTION
SORT

SORTED ARRAY
3 4 7 14 16 23 53

INSERTION SORT

OBJECTIVE
• Understand how insertion sort works.
• Mastering nested loops
• Reasoning ability
• Mastering 1D array(modify,insert)
• Conceptualizing to real world

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.

Example- Lets enter some random elements.
1
1
215
3
5
4
Now lets try to sort array is using insertion sort.

1
1
215
3
5
4
5 21
1
1
3
5
4
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

4 215
3
5
1
1
1 2
1
1
4
3
5
5
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
3
5

1 2
1
1
4
3
5
5
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
1
1
52
3
5
4

IMPLEMENTATI
ON

1 2
1
1
4
3
5
5
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

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]
else
break;
}
a[j+1] = key;MR. GOVERDHAN SATISH K.V, PGT CS, KV

Insertion sort - function
void 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]
else
break;
}
a[j+1] = key;
display(a,n);
}
}

Questionnaire
• Name any two applications of insertion sort.
• Is there any other way we can implement
insertion sort.

Sorting Techniques - Govardhan Satish

More Related Content

Viewers also liked (14)

More from Dipayan Sarkar (18)

Recently uploaded (20)

Sorting Techniques - Govardhan Satish