Scribd
Upload
14 views8 pages

Array

Uploaded by

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

Array

Uploaded by

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

TOPIC: ARRAY SORTING ALGORITHM

SUBMITTED BY :-
ANUJ KUMAR SINGH
ROLL NO.-24
STREAM- AIML
CONTENT

 Introduction
 Bubble Sort
 Insertion Sort
 Selection Sort
 Conclusion
INTRODUCTION
Welcome everyone to today's presentation on array sorting algorithms.
Today, we're going to delve into the world of computer science and explore
a topic that is both fascinating and incredibly useful in our daily lives.
Sorting algorithms may not sound like the most exciting thing in the
world, but they are absolutely essential for organizing data efficiently.
Imagine trying to find a specific item in an unsorted list of thousands – it
would be like searching for a needle in a haystack! Sorting algorithms help
us avoid this problem by quickly and accurately organizing data so that we
can easily access what we need. So, let's dive in and learn more about these
powerful tools!
BUBBLE SORT
Bubble sort is a simple sorting algorithm that repeatedly steps through the
list, compares adjacent elements and swaps them if they are in the wrong
order. The pass through the list is repeated until the list is sorted. This
algorithm is called bubble sort because with each step, the largest element
in the list bubbles up to the top, like a bubble rising to the surface of water.
because with each step, the largest element in the list bubbles up to the top,
like a bubble rising to the surface of water .
INSERTION SORT

Insertion sort is another simple sorting algorithm that works by dividing


an array into two parts: a sorted part and an unsorted part. The sorted
part starts with the first element of the array, and the unsorted part
includes all remaining elements.
SELECTION SORT

Selection sort is another simple sorting algorithm that works by dividing


the input list into two parts: the sorted part at the left end and the unsorted
part at the right end. Initially, the sorted part is empty and the unsorted
part contains the entire list. The algorithm then repeatedly selects the
smallest element from the unsorted part and moves it to the end of the
sorted part until the entire list is sorted.
CONCLUSION
In conclusion, I have covered three popular sorting algorithms: bubble sort,
insertion sort, and selection sort. Each algorithm has its own strengths and
weaknesses, and it is important to choose the right one for a given situation.
I have also discussed best practices for choosing a sorting algorithm, such as
considering the size of the data set and the desired level of sorting efficiency.
By following these guidelines, you can ensure that your sorting operations are
both effective and efficient.

You might also like