This week's book giveaway is in the OO, Patterns, UML and Refactoring forum. We're giving away four copies of Refactoring for Software Design Smells: Managing Technical Debt and have Girish Suryanarayana, Ganesh Samarthyam & Tushar Sharma on-line! See this thread for details.
I'm havin difficulty with this class assignment. The code is writin down below. I have to place the largest number in the highest element of the array; after the second pass the 2 highest numbers, and so on. then instead of making nine comparisions on every pass make 8 on the second and so on. Then I have to modify the sort to check at the end of each pass if any swaps have been made. If none have been made, the data must already be in the proper order, so the program should terminate. if the swaps have been made, at least one more pass is needed.