Implementation of the Bubble sort algorithm (works by repeatedly swapping the adjacent elements if they are in the wrong order).
-
Notifications
You must be signed in to change notification settings - Fork 0
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.
marta-pylypchuk/bubble-sort-algorithm
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
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 0
No packages published