pailie.cpp

软件算法处理

#include <iostream>
#include <stdlib.h>
#include <string.h>
template <class T>
extern TableInsertSort(T a[], int N);
template <class T>
inline void Swap(T& a, T& b)
{
	T temp = a; a = b; b = temp;
}

template<class T>
void Perm(T list[], int k, int m)
{ 
	int i;
	if (k == m) {
		for (i = 0; i <= m; i++)
			cout << list [i];

		cout << endl;
	}
	else 

	for (i=k; i <= m; i++) {
		Swap (list[k], list[i]);
		Perm (list, k+1, m);
		Swap (list [k], list [i]);
	}
}
template<class T>
void Perm2(T list[], int k, int m)
{ 
	int i;
	do{

	}while 
	for (i=k; i <= m; i++) {
		if (k == m) {
			for (i = 0; i <= m; i++)
				cout << list [i];
			cout << endl;
		}
		else 
			Swap (list[k], list[i]);
			Perm (list, k+1, m);
			Swap (list [k], list [i]);
	}
}

void main()
{
	char s[]="abc";
	//#if 0
	Perm(s,0,sizeof(s)/sizeof(char)-2);
	//#endif
	int a[]={2,44,11,0,66,12};
	TableInsertSort(a,6);
}