Scribd
Upload
19 views18 pages

SORTING

The document discusses different sorting algorithms including bubble sort, insertion sort, and others. Bubble sort compares adjacent elements and swaps them if out of order until sorted. Insertion sort selects elements and inserts them into the sorted portion of the array, shifting other elements over as needed.

Uploaded by

t29.sammat
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
19 views18 pages

SORTING

The document discusses different sorting algorithms including bubble sort, insertion sort, and others. Bubble sort compares adjacent elements and swaps them if out of order until sorted. Insertion sort selects elements and inserts them into the sorted portion of the array, shifting other elements over as needed.

Uploaded by

t29.sammat
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 18

TOPICS TO BE COVERED

•SORTING
•TYPES OF SORTING
•BUBBLE SORTING
•INSERTION SORTING
•SORTING
•Referred as Rearranging the data or elements
•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.
TYPES OF SORTING
•Quick Sort.
•Bubble Sort.
•Merge Sort.
•Insertion Sort.
•Selection Sort.
•Heap Sort.
•Radix Sort.
•Bucket Sort.
Bubble Sorting
Bubble sort compares the value of first element with the
immediate next element and swaps according to the
requirement and goes till the last element. This iteration
repeates for (N - 1) times/steps where N is the number of
elements in the list.
Bubble Sorting (Ex.4, 9 ,5, 1, 0)
Bubble Sorting
Bubble Sorting
Bubble Sorting

Before Sorting : 4, 9, 5, 1, 0
After Sorting : 0, 1, 4, 5, 9
Bubble Sorting
Ex.1 : 41, 29, 15
Ex.2 : 41, 29, 15, 30
Ex.3 : 210, 117, 52, 79, 22
Bubble Sorting Example -2
INSERTION SORT
• One element from the array is selected and is compared
to the one side of the array and inserted to the proper
position while shifting the rest of the elements
accordingly.
• Insertion sort is a simple sorting algorithm that works
similar to the way you sort playing cards in your hands.
The array is virtually split into a sorted and an unsorted
part. Values from the unsorted part are picked and
placed at the correct position in the sorted part.
characteristics of Insertion Sort:
1. It is efficient for smaller data sets, but very inefficient for larger
lists.
2. Insertion Sort is adaptive, that means it reduces its total
number of steps if a partially sorted array is provided as input,
making it efficient.
3. It is better than Selection Sort and Bubble Sort algorithms.
4. Its space complexity is less. Like bubble Sort
5. insertion sort also requires a single additional memory space.
6. It is a stable sorting technique, as it does not change the
relative order of elements which are equal.
Insertion Sorting
• Selects one element from start index =1.
• It is compared to the left side elements one by one.
• If the element is bigger then the selected element, it is shifted to
right. A hole is created while this shifting. Then this process is
repeated till index reaches to first element.
• Element is not moved when value is less than the selected
element. The hole is not shifted in this case.
• Now finally the selected element is moved to hole. Now this
element reached to its proper position.
• After this the next position or array index 2 is selected. Then
repeat the same process.
• Gradually all the left side elements are moved and becomes
sorted.
EXAMPLE – 1
EXAMPLE – 2
EXAMPLE – 3
RECAPITULATION
•SORTING
•TYPES OF SORTING
•BINARY SORT
•INSERTION SORT
•CHARACTERISTICS OF INSERTION SORT
•INSERTION SORT STEPS
•EXAMPLES
S. SHUNMUGA SUNDARAM M.E/CSE

You might also like