Bubble Sort in Descending Order
About this code I called it Bubble Sort in Descending Order in C++.
Bubble sort is a simple sorting algorithm. It 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 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.
If you find my work useful send me an email at firstname.lastname@example.org. I am also accepting programming jobs, assignments, projects or thesis with a very reasonable and affordable price. Please contact me through my email at mobile phone number. My mobile phone numbers here in the Philippines is 09296768375 and my telephone number at home is +63 (034) 4335081. Thank you very much and Happy Programming.
Mr. Jake Rodriguez Pomperada, MAED-Instructional Technology
Programmer, Teacher and Computer Technician
Note: Due to the size or complexity of this submission, the author has submitted it as a .zip file to shorten your download time. After downloading it, you will need a program like Winzip to decompress it.
Virus note: All files are scanned once-a-day by SourceCodester.com for viruses, but new viruses come out every day, so no prevention program can catch 100% of them.
FOR YOUR OWN SAFETY, PLEASE:
1. Re-scan downloaded files using your personal virus checker before using it.
2. NEVER, EVER run compiled files (.exe's, .ocx's, .dll's etc.)--only run source code.