（精品课件）第二次作业（9.22评讲）.doc

P56 Exercise 2.1 E4(a)(b) (a) For n = 3, find all possible permutations that can be obtained. There are five permutations: 1 2 3 1 3 2 2 1 3 3 2 1 3 1 2. (b) For n=4, find all possible permutations that can be obtained. There are 14 such permutations: 1 2 3 4 1 2 4 3 1 3 2 4 1 4 2 3 1 4 3 2 2 1 3 4 2 1 4 3 3 1 2 4 3 2 1 4 4 1 2 3 4 1 3 2 4 2 1 3 4 3 1 2 4 3 2 1 (c)C(2n,n) P64 Exercise 2.2 E2, E4 E2. Start with the stack methods, and write a function copy_stack with the following specifications: Error_code copy_stack(Stack dest, Stack source); precondition: None. postcondition: Stack dest has become an exact copy of Stack source; source is unchanged. If an error is detected, an appropriate code is returned; otherwise, a code of success is returned. (a) Simply use an assignment statement: dest = source; Answer Error_code copy_stack(Stack dest, Stack source) /* Pre: None. Post: Stack dest has become an exact copy of Stack source; source is unchanged. If an error is detected, an appropriate code is returned; otherwise, a code of success is returned. */ { dest = source; return success; } (b) Use the Stack methods and a temporary Stack to retrieve entries from the Stack source and add each entry to the Stack dest and restore the Stack source. Answer Error_code copy_stack(Stack dest, Stack source) /* Pre: None. Post: Stack dest has become an exact copy of Stack source; source is unchanged. If an error is detected, an appropriate code is returned; otherwise, a code of success is returned. */ { Error_code detected = success; Stack temp; Stack_entry item; while (detected == success !source.empty( )) { detected = source.top(item); detected = source.pop( ); if (detected == success) detected = temp.push(item); } while (detected == success !temp.empty( )) { detected = temp.top(item); detected = temp.pop( ); if (detected == success) detected = source.push(item); if (detected == success) detected = dest.push(item); } return detected; } (c) Write the function as