* 6.5 递归程序的模拟转换为非递归 由此流程图得程序如下: void P1( int n ){ stack s ; while ( n > 0 ) { s.push ( n ; n = n - 1; } while ( !s.empty( ) ) { s.pop ( n ; cout < n; } } stack s; n>0 s.push(n; n=n-1; s.empty( ? s.pop