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

Update main.c #5

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

Update main.c #5

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
6 changes: 4 additions & 2 deletions C/Bubble Sort/main.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -3,7 +3,9 @@
/*
The Bubble Sort is just one of many methods out there to "sort lists of data". It is
certainly NOT the fastest method, but it's pretty simple to implement and if you don't need
a blazing fast sort routine, it will get the job done.
a blazing fast sort routine, it will get the job done Logic behind this is When you have bubbles
the big bubble will have more air and will go up than the smmaller one similarly here after every
loop Big number goes to right till completion.

The Bubble Sort works like this:

Expand Down Expand Up @@ -140,5 +142,5 @@ void BubbleSort(int *numArray, int num, bool l2g)

/*-------------------------*\
| Programmed by: TheTutor |
| �2006 GameTutorials, LLC |
| ©2006 GameTutorials, LLC |
\*-------------------------*/