Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
66 views

Bubble Sort Algorithm Bubble Sort Is A Simple Algorithm Which Is Used To Sort A Given Set of

Bubble Sort is a simple algorithm that sorts elements in an array by comparing adjacent elements and swapping them if out of order. It repeats this process, making multiple passes through the array, until the array is fully sorted. On each pass, the largest elements bubble up to the end of the array. Bubble Sort compares and swaps elements sequentially over multiple iterations until the array is in ascending order.

Uploaded by

Agrippa Mungazi
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
66 views

Bubble Sort Algorithm Bubble Sort Is A Simple Algorithm Which Is Used To Sort A Given Set of

Bubble Sort is a simple algorithm that sorts elements in an array by comparing adjacent elements and swapping them if out of order. It repeats this process, making multiple passes through the array, until the array is fully sorted. On each pass, the largest elements bubble up to the end of the array. Bubble Sort compares and swaps elements sequentially over multiple iterations until the array is in ascending order.

Uploaded by

Agrippa Mungazi
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Bubble Sort Algorithm

Bubble Sort is a simple algorithm which is used to sort a given set of n elements provided in
form of an array with n number of elements. Bubble Sort compares all the element one by one
and sort them based on their values.
If the given array has to be sorted in ascending order, then bubble sort will start by comparing
the first element of the array with the second element, if the first element is greater than the
second element, it will swap both the elements, and then move on to compare the second and the
third element, and so on.
If we have total n elements, then we need to repeat this process for n-1 times.
It is known as bubble sort, because with every complete iteration the largest element in the
given array, bubbles up towards the last place or the highest index, just like a water bubble rises
up to the water surface.
Sorting takes place by stepping through all the elements one-by-one and comparing it with the
adjacent element and swapping them if required.

You might also like