Skip to content

Latest commit

 

History

3 Commits

Folders and files

NameName
Last commit message
Last commit date
 
 
 
 
 
 
 
 

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

0 stars

Watchers

1 watching

Forks

Releases

Packages

Contributors

Languages