Bubble Sort Algorithm Overview

April 9, 2021

Course Instructor: Elliot Forbes

Hey Gophers! My name is Elliot and I'm the creator of TutorialEdge and I've been working with Go systems for roughly 5 years now. Feel free to reach out to me on twitter - @Elliot_F

👋 Hey Gophers, in this video, we are going to have a look at the Bubble Sort algorithm overview and how it works as well as the time complexity and it’s characteristics!


Now the first algorithm that we are going to be looking at within this course is the bubble sort algorithm.

The bubble sort algorithm is a comparision sorting algorithm that will repeatedly pass through a list and compare each element within the list against the next element. If the first element is greater than the next element then these elements will be swapped.

We then pass through this array until each element of the array is in its correct position.

It will then continue passing through this array until there are no swaps performed and we know that the array has been sorted.

Quiz Time

Validate what you’ve learned in this video by attempting these quiz questions: