百度2014软件研发笔试题算法题1（上海站）

baidu2014_algo1

#include <cstdlib>
#include <iostream>

using std::cout;
using std::endl;

const int NUM = 4;
int data[NUM];

void init(int data[], int n) {
    for (int i = 0; i<= n-1; i++) {
		data[i] = i;
	}
}
void print(int data[], int n) {
    for (int i = 0; i <= n-2; i++) {
		cout << data[i] << " ";
		if ((i+1)%10 == 0) {
			cout << endl;
		}
	}
	cout << data[n-1] << endl;
}

template <typename T>
void swap(T &a, T &b) {
	T temp = a;
	a = b;
	b = temp;
}

// output the combinations.
void print_comb(int data[], int n) {
	for (int i = 0; i <= n-1; i++) {
		print(data,i+1);
		
		for (int j = 0; j <= i; j++) {
			for (int k = i+1; k <= n-1; k++) {
				swap(data[j], data[k]);
				print_comb(data, i+1);
				swap(data[j], data[k]);
			}
		}
	}
}

int main(int argc, char* argv[]) {
	init(data, NUM);
	print_comb(data, NUM);


	return 0;
}