Forums: » Register « |  Free Tools |  User CP |  Games |  Calendar |  Members |  FAQs |  Sitemap |  Support |
 User Name: Password: Remember me

New Free Tools on Dev Shed!
We're Excited to announce that Dev Shed now has 70 free tools on the site. To learn more, click here!

 Dev Shed Forums Sponsor:
#1
February 12th, 2003, 04:32 PM
 andy3109
Contributing User

Join Date: Nov 2002
Posts: 421
Time spent in forums: 15 h 46 m 21 sec
Reputation Power: 12
bubble sort

I am getting into simple algorithms. I am starting with the bubble sort which was suggested by a friend. He ended up giving me the code to look at. Here is the code and the questions I have:

#include <iostream.h>

int main() {

int array[] = {22, 23, 21, 20};
int n = 4;
for ( int i = 0; i < n-1; i++ ) { <--- Why n-1?
for ( int j = 1; j < n-i; j++ ) { <--- n-i now?
if ( array[j-1] > array[j] ) {
int temp;
temp = array[j-1]; <----Why did he make a temp array?
array[j-1] = array[j];
array[j] = temp;
}

}
}

for (int x = 0; x < 4; x++) {
cout << array[x] << "\n";

}

cout << "\nThanks for using the bubble sort program!\n\n";
return 0;

}

I do understand that after one cycle the highest number is at the end, so the n-1 tells the program it doesn't need to check the last number...but I think im missing something. Thanks in advance guys.

-andy
__________________
hmmm...

Last edited by andy3109 : February 12th, 2003 at 04:36 PM.

#2
February 12th, 2003, 04:46 PM
 Scorpions4ever
Banned ;)

Join Date: Nov 2001
Location: Woodland Hills, Los Angeles County, California, USA
Posts: 9,539
Time spent in forums: 2 Months 3 Days 9 h 6 m 49 sec
Reputation Power: 4106
Code:
```if ( array[j-1] > array[j] ) {
int temp;
temp = array[j-1]; <----Why did he make a temp array?
array[j-1] = array[j];
array[j] = temp;
}```

He's not making a temp array. All he's doing is declaring a temp variable and using it to swap the values of two array elements. Let's say you have two variables a and b and want to swap the values. This is how you would do it:
Assign the value of 'a' to a temp variable, say 'c'
Assign the value of 'b' to 'a'
Assign the value of 'c' to 'b'

As for what the rest of it does, I'd suggest you study how the bubble sort algorithm works. Start with this article http://www.devarticles.com/art/1/76/2
Note that the code that the author presents in that article is a bubble sort, but is less optimal than your friend's code (because it performs longer loops than is actually necessary). However, the concept of the bubble sort is explained pretty decently there. Hope this helps!

#3
February 12th, 2003, 05:01 PM
 7stud
Contributing User

Join Date: Feb 2001
Posts: 1,365
Time spent in forums: 18 h 20 m 28 sec
Reputation Power: 14
andy,

The temporary variable is required to swap values. You can't do this:

int a=5
int b=10;

a=b;
b=a;

Do you see why? If you set a equal to b, then a equals 10(the 5 is overwritten), then if you set b equal to a, b will equal 10, which was it's original value. Somehow you have to save the value for a or else you will lose it. That's where the temporary variable comes into play.

I admit those index values are not easy to follow, so a good programmer would explain them with comments. Otherwise, you need to read up on the algorithm used and go through the loop by hand recording values for all the variables to see what's happening. Generally speaking though, the outer loop(i loop) is going to be peformed 3 times(n-1=3) which means the code is going to traverse the array three times doing swaps, but each time through the array you don't have to perform as many swaps(n-i gets smaller).

Last edited by 7stud : February 12th, 2003 at 05:36 PM.

#4
February 12th, 2003, 05:49 PM
 7stud
Contributing User

Join Date: Feb 2001
Posts: 1,365
Time spent in forums: 18 h 20 m 28 sec
Reputation Power: 14
That was a great link for explaining how the bubble sort works.

I gathered from the article that since the largest value is moved to the end of the array the first time through the array, subsequent examinations don't need to look at the last element, and the next time through the array, the second largest number is second from the end, so the last two elements don't need to be examined subsequently, and so forth, hence the (n-i) in the inner loop of the code andy posted.

Last edited by 7stud : February 12th, 2003 at 05:52 PM.

#5
February 12th, 2003, 08:07 PM
 Scorpions4ever
Banned ;)

Join Date: Nov 2001
Location: Woodland Hills, Los Angeles County, California, USA
Posts: 9,539
Time spent in forums: 2 Months 3 Days 9 h 6 m 49 sec
Reputation Power: 4106
Quote:
 Originally posted by 7stud I gathered from the article that since the largest value is moved to the end of the array the first time through the array, subsequent examinations don't need to look at the last element, and the next time through the array, the second largest number is second from the end, so the last two elements don't need to be examined subsequently, and so forth, hence the (n-i) in the inner loop of the code andy posted.

Yep, that's exactly the optimization I was talking about.

 Viewing: Dev Shed Forums > Programming Languages > C Programming > bubble sort

## Developer Shed Advertisers and Affiliates

 Thread Tools Search this Thread Search this Thread: Advanced Search Display Modes Rate This Thread Linear Mode Rate This Thread: 5 : Excellent 4 : Good 3 : Average 2 : Bad 1 : Terrible

 Posting Rules You may not post new threads You may not post replies You may not post attachments You may not edit your posts vB code is On Smilies are On [IMG] code is On HTML code is Off
 View Your Warnings | New Posts | Latest News | Latest Threads | Shoutbox Forum Jump Please select one User Control Panel Private Messages Subscriptions Who's Online Search Forums Forums Home -------------------- Programming Languages    PHP Development        PHP FAQs and Stickies    Perl Programming        Perl FAQs and Stickies    C Programming        C Programming FAQs and Stickies    Java Help        Java FAQs    Python Programming        Python Programming FAQs    Ruby Programming        Ruby Programming FAQs    Game Development        Game Development FAQs Programming Languages - More    ASP Programming        ASP Programming FAQs    .Net Development        .Net Development FAQs    Visual Basic Programming        Visual Basic Programming FAQs    Software Design        Software Design FAQs    ColdFusion Development        ColdFusion Development FAQs    Delphi Programming        Delphi Programming FAQs    Regex Programming        Regex Programming FAQs    XML Programming        XML Programming FAQs    Other Programming Languages        Other Programming Languages FAQs Web Design    HTML Programming        HTML Programming FAQs    JavaScript Development        JavaScript Development FAQs    CSS Help        CSS Help FAQs    Flash Help        Flash Help FAQs    Photoshop Help        Photoshop Help FAQs    Web Design Help        Web Design Help FAQs    Website Critiques        Website Critiques FAQs    Search Engine Optimization        Search Engine Optimization FAQs Mobile Programming    Mobile Programming        Mobile Programming FAQs    iPhone SDK Development        iPhone SDK Development FAQs    Android Development        Android Development FAQs    BlackBerry Development        BlackBerry Development FAQs Web Site Management    Business Help        Business Help FAQs    Development Software        Development Software FAQs    Scripts        Scripts FAQs Databases    Database Management        Database Management FAQs    DB2 Development        DB2 Development FAQs    MySQL Help        MySQL Help FAQs    PostgreSQL Help        PostgreSQL Help FAQs    Firebird SQL Development        Firebird SQL Development FAQs    MS SQL Development        MS SQL Development FAQs    Oracle Development        Oracle Development FAQs    LDAP Programming        LDAP Programming FAQs System Administration    Mail Server Help        Mail Server Help FAQs    Apache Development        Apache Development FAQs    Security and Cryptography        Security and Cryptography FAQs    Antivirus Protection        Antivirus Protection FAQs    DNS        DNS FAQs    IIS        IIS FAQs    Networking Help        Networking Help FAQs    FTP Help        FTP Help FAQs Operating Systems    BSD Help        BSD Help FAQs    Linux Help        Linux Help FAQs    UNIX Help        UNIX Help FAQs    Windows Help        Windows Help FAQs    Mac Help        Mac Help FAQs Web Hosting    Web Hosting        Web Hosting FAQs    Free Web Hosting        Free Web Hosting FAQs    Web Hosting Requests        Web Hosting Requests FAQs    Web Hosting Offers        Web Hosting Offers FAQs Computer Hardware    Computer Hardware    CPUs        CPUs FAQs    Cooling        Cooling FAQs    Embedded Programming        Embedded Programming FAQs    Motherboards        Motherboards FAQs    Multimedia Hardware        Multimedia Hardware FAQs Other    Dev Shed Lounge        Dev Shed Lounge FAQs    Development Articles        Development Articles FAQs    Beginner Programming        Beginner Programming FAQs    Hire A Programmer        Hire A Programmer FAQs    Project Help Wanted        Project Help Wanted FAQs Latest News Updated Hourly    Technology News    Business News    Science News Forum Information    Forum Rules/Guidelines        Forum Rules/Guidelines FAQs    Forum Announcements        Forum Announcements FAQs    Dev Shed Gaming Center        Go to the Dev Shed Battle Arena        Go to the Dev Shed Arcade Games        Go to the Legend of the Green Dragon    Suggestions & Feedback        Suggestions & Feedback FAQs

 Forums: » Register « |  Free Tools |  User CP |  Games |  Calendar |  Members |  FAQs |  Sitemap |  Support |