This preview shows page 1. Sign up to view the full content.
Unformatted text preview: return to the main routine that should then output the sorted array to the console Note that all the array elements comparison and swap must be done from within the recursive bubble sort procedure (e.g., 1-element arrays, which are always sorted, must be detected in the recursive bubble sort procedure). By single stepping your program determine how many instructions are executed in your recursive bubble sort procedure for 1-element, 2-element and 3-element arrays and report these instruction counts as comments in your code. A bonus of 2 points will be given to the 15 fastest (i.e., least number of instructions executed) correctly running programs submitted....
View Full Document
This note was uploaded on 09/30/2008 for the course CMPEN 331 taught by Professor Bhat during the Spring '08 term at Pennsylvania State University, University Park.
- Spring '08