This preview shows page 1. Sign up to view the full content.
Unformatted text preview: 5. count all the comparisons necessary in shuffleStack methods (like pop, push, peek) 6. no need for isEmpty since stack operations can check for top==0. so no need to count comparisons for isEmpty if defined. 7. count all comparisons up to and including successful sort. also count comparisons necessary to determine that sort cannot be done....
View Full Document
This note was uploaded on 05/04/2008 for the course CS 352 taught by Professor Mullins during the Winter '07 term at University of Missouri-Kansas City .
- Winter '07