Skip to content

Bubble sort is a type of sorting algorithm we can use to arrange a set of values in ascending order. A real-world example is how the contact list on our phones is sorted in alphabetical order. This algorithm is not suitable for large data sets as its average and worst-case time complexity is quite high.

Notifications You must be signed in to change notification settings

marta-pylypchuk/bubble-sort-algorithm

Folders and files

NameName
Last commit message
Last commit date
Jan 5, 2023
Jan 5, 2023
Jan 5, 2023
Jan 5, 2023

Repository files navigation

Implementation of the Bubble sort algorithm (works by repeatedly swapping the adjacent elements if they are in the wrong order).

About

Bubble sort is a type of sorting algorithm we can use to arrange a set of values in ascending order. A real-world example is how the contact list on our phones is sorted in alphabetical order. This algorithm is not suitable for large data sets as its average and worst-case time complexity is quite high.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages