Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

marta-pylypchuk/bubble-sort-algorithm

Open more actions menu

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
3 Commits
 
 
 
 
 
 
 
 

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

Packages

Contributors

Languages

Morty Proxy This is a proxified and sanitized view of the page, visit original site.