VELALAR COLLEGE OF ENGINEERING AND TECHNOLOGY

DEPARTMENT OF INFORMATION TECHNOLOGY

INNOVATIVE PRACTICES

Course code : 16CST32 Date: 5.10.2018

Course Name: Data Structures

Innovative Method: Role Play

Topic: Sorting Algorithms (Bubble, Insertion and Selection Sort)

Student Members in Role Play:

Role
Sl.No. Register Number Name (Assigned Number)

1 17ITR064 Nandha R 56
2 17ITR072 Pavithra K 78
3 17ITR079 Priya Dharshini R 67
4 17ITR086 Ravikumar S -45
5 17ITR090 Sabeena S 188
6 17ITR098 Saranya S 34
7 17ITR110 Srivarshini R 123
8 17ITR085 Rasika J 22
9 17ITR121 Vaishali K 99
10 17ITR063 Mythili V Temp

Preamble:

Role-play is any speaking activity based on a concept where a student put himself into
an imaginary situation. The joy of role-play is that students can act the role allotted for a
short time. Students can also take on the opinions of someone else.

Role Play Description

Bubble Sort

Number assigned to each student as mentioned above and the stand left to right. Role
play start with Bubble Sort with Nandha, he compares her number (56) with next
student Pavithra (78). The number assigned Nandha (56) is less than the number
assigned to Pavithra (78) who stands next to him. So no exchange takes place. Next the
number with Pavithra (78) is compared to the number assigned to Priya Dharshini (67)
which is greater now the swapping takes place(they exchange their standing positions).
This step continues until the last number in the list is reached. Sabeena (188) reached to
the end of the list during this first step. Now the students can able to understand the
greatest number reached its position. This process continues n-1 time where n is the
number of students in the list.

Insertion Sort

Students come back to their original position after the Bubble sort. Now they start the
play with insertion sort. Now Nandha (56) assumes he is in his right place (Sorted Array)
Now Pavithra (78) compare her number with Nandha (56) which is greater so insertion
takes place. Now Pavithra (78) is also in sorted array. Next Priya Dharshini (67) the first
member from the unsorted array comes forward and compare her value with the sorted
list. She finds her right position between Nandha (56) and Pavithra (78) she takes her
place by shifting Pavithra (78) one place right. This process continues until all the
elements sorted.

Selection Sort.

Students come back to their original location, now the selection sort begins. This sort
starts by selecting the smallest element in the list. This is done by having Temp location,
first number Nandha (56) is assigned to Mythili (Temp) then the Temp compares with all
location to pick the smallest element, when the temp reaches Ravikumar (-45), Now Temp
has -45 because it is less than 56. This process continues until the last element is
checked. No others less than Ravikumar (-45), he has the minimum in the list. So he has
to swap his place with Nandha (56). Now the new first element in the sorted array
remains in the unsorted array. The process of finding smallest element and swap
continues up to the last person in the list.
A Sorting Algorithm is used to rearrange a given array or list elements according to a
comparison operator on the elements. The comparison operator is used to decide the new
order of element in the respective data structure.
Selection Sort

 The selection sort algorithm sorts an array by repeatedly finding the minimum
element (considering ascending order) from unsorted part and putting it at the
beginning. The algorithm maintains two subarrays in a given array.
 The subarray which is already sorted.
 Remaining subarray which is unsorted.
 In every iteration of selection sort, the minimum element (considering ascending
order) from the unsorted subarray is picked and moved to the sorted subarray.
Bubble Sort

 Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping
the adjacent elements if they are in wrong order.
Insertion Sort

 Insertion sort is a simple sorting algorithm that works the way we sort playing
cards in our hands.

17ITR063 MYTHILI V
17ITR064 NANDHA R
17ITR065 NANDHINI S S
17ITR066 NANDHINI SRI S
17ITR067 NANTHAGOPAL J
17ITR068 NAVEENKUMAR M
17ITR070 NAVEENKUMAR N G
17ITR071 NIMISHA V
17ITR072 PAVITHRA K
17ITR073 POONGODI V
17ITR074 PRAVEEN KUMAR B (06.01.2000)
17ITR075 PRAVEEN KUMAR B (20.07.2000)
17ITR076 PRAVEENKUMAR S
17ITR077 PRITHA KUMARI S
17ITR078 PRIYA M
17ITR079 PRIYA DHARSHINI R
17ITR080 PRIYAMATHI N
17ITR081 RAJAVIGNESH S
17ITR082 RAMESH S
17ITR083 RANJITH S
17ITR084 RASHMIHA K
17ITR085 RASIKA J
17ITR086 RAVIKUMAR S
17ITR087 ROHINI P
17ITR088 ROOBINEE M J
17ITR089 SABARI SREE K
17ITR090 SABEENA S
17ITR091 SANDIYA A
17ITR093 SANGETHA R S
17ITR094 SANGEETHAPRIYA D
17ITR095 SANJANA R
17ITR096 SANTHIYA V
17ITR097 SARANYA G
17ITR098 SARANYA S
17ITR099 SATHASIVAM B
17ITR100 SELVA KUMAR V S
17ITR101 SHANMATHI K
17ITR102 SHIFA H
17ITR103 SHOBANA P
17ITR104 SHREE DHASIYA V
17ITR105 SHUVAKRUHI K S
17ITR106 SIMALAHAMED A
17ITR107 SINDU R
17ITR108 SOWMIYA K R
17ITR109 SOWMIYA S
17ITR110 SRIVARSHINI R
17ITR111 SUBASH S
17ITR112 SUDHA G P
17ITR113 SUJITH S
17ITR114 SUSAI PRAKASH A
17ITR115 SWATHI K
17ITR116 THAJMEELMOHAMMED S
17ITR117 THANGAMANI V
17ITR118 THARACHANDAR B
17ITR119 THILAK S D
17ITR120 THIRIVENI V
17ITR121 VAISHALI K
17ITR122 VIGNESH M
17ITR123 VIJAY GOPINATH R
17ITR124 VISHNUPRIYA K
17ITR125 YUVASHREE S