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

Bubble Sorting Algorithms

The document discusses the bubble sorting algorithm, which orders a random sequence of numbers by repeatedly swapping adjacent elements that are in the wrong order until the sequence is fully sorted. It provides an example of bubble sorting a list of numbers from highest to lowest by repeatedly checking for out-of-order elements and swapping them, and notes that the process can also sort in ascending order. References are included for additional information on bubble sorting.

Uploaded by

Uthayakumar Gangezwer
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
41 views

Bubble Sorting Algorithms

The document discusses the bubble sorting algorithm, which orders a random sequence of numbers by repeatedly swapping adjacent elements that are in the wrong order until the sequence is fully sorted. It provides an example of bubble sorting a list of numbers from highest to lowest by repeatedly checking for out-of-order elements and swapping them, and notes that the process can also sort in ascending order. References are included for additional information on bubble sorting.

Uploaded by

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

Bubble Sorting Algorithms

Department of Computing
(B.Eng.)in Software Engineering

Module:4COSC006C Programming Principles 1

Module Leader: Mr.Achala Aponso

Date of submission:1.11.2019

Student ID:2019100

Student UoW ID:W1761186

Student First Name:Gangezwer

Student Surname:Uthayakumar
Contents

01.Introduction

02.The Details of bubble sorting

03.Conclusion

04.References
01.Introduction

In this above report I am going to discuss about the sorting of


the algorithms with the help of lecturer Achala Aponso sir’s
guidance video on the you tube.

So here we are gonna learn about the ordering algorithms by


By using the certain set of numbers by swaping the number
And interchanging them on a certain order.

so I am going to discuss the above topic on this report.


The Details of Bubble Sorting

So basically the bubble sorting is all about the sorting of certain
series of number which were presented in a random order.

It can be explained through a example easily,

{6,2,7,3,5,4}

Here we have to organize the above number pattern in a order by


swaping them.

6 2 7 3 5 4

So here 5>2 so we have to do the swapping


2 6 7 3 5 4

So here 7>3 so we have to do the swapping

2 6 3 7 5 4

So here 7>5 so we have to do the swapping

2 6 3 5 7 4

So here 7>4 so we have to do the swapping

2 6 3 5 4 7

So after all the iterations 7 is at the right place.So we can repeat the
same actions to get that sequence in an ascending order.

So 6>3 we have to the swapping

2 3 6 5 4 7
So 6>5 we have to the swapping

2 3 5 6 4 7

So 6>4 we have to the swapping

2 3 5 4 6 7

So finally got the ascending order of the random number sequence by


doing the interchanging and the swapping of the numbers.So this
mechanism is commonly called as the ‘Bubble Sorting’.

We can do this above actions to get a descending order of this


random number sequence.So Bubble Sorting is a two way thing so
we can work on that way or this way.
References
Studytonight.com. (2019). Bubble Sort Algorithm | Studytonight. [online] Available at:
https://www.studytonight.com/data-structures/bubble-sort [Accessed 1 Nov. 2019].

YouTube. (2019). Bubble Sort Algorithm for Beginners [Quick Introduction with Demo] [9 mins].
[online] Available at: https://www.youtube.com/watch?v=Hc_1mLX2T90 [Accessed 1 Nov. 2019].

You might also like