栈
0.1
数据结构_第3章
|
全排列 More...
#include "Stack.hh"
#include <algorithm>
#include <ctime>
#include <iostream>
#include <string>
#include <utility>
Go to the source code of this file.
Namespaces | |
ch3_3 | |
Functions | |
template<class T > | |
void | ch3_3::swap (T &a, T &b) |
template<class BidirIt > | |
void | ch3_3::reverse (BidirIt first, BidirIt last) |
template<class BidirIt > | |
void | ch3_3::permuteWithFixedPrefix (BidirIt first, BidirIt last, BidirIt fixPos) |
template<class BidirIt > | |
void | ch3_3::permuteWithFixedPrefix_Loop (BidirIt first, BidirIt last, BidirIt fixPos) |
template<class T > | |
void | ch3_3::permute_rec (const T &_s) |
template<class T > | |
void | ch3_3::permute_loop (const T &_s) |
template<class BidirIt > | |
bool | ch3_3::next_perm (BidirIt first, BidirIt last) |
template<class T > | |
void | ch3_3::permute_stl (const T &_s) |