Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Update bubble_sort.h #170

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Update bubble_sort.h #170

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion include/bubble_sort.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -11,7 +11,7 @@
* sorting algorithm that works by repeatedly stepping through the list to be
* sorted, comparing each pair of adjacent items and swapping them if they are
* in the wrong order. The pass through the list is repeated until no swaps are
* needed, which indicates that the list is sorted. The algorithm gets its name
* required, which indicates that the list is sorted. The algorithm gets its name
* from the way smaller elements "bubble" to the top of the list. Because it
* only uses comparisons to operate on elements, it is a comparison sort.
* Although the algorithm is simple, most of the other sorting algorithms are
Expand Down