shuffle算法

Shuffle algorithm is very useful in many programs. The algorightm can reorder the elements in a set randomly. It is used in the field of network, data processing, etc.

 

The algorithm is very simple. We have N elements in the Array and we want to rerange the elements again in a random order.

The code is as follows:

#include <time.h> #include <stdio.h> #include <iostream> #include <algorithm> template<typename T> void output(T * array,int n) { for(int i = 0 ;i < n;++i) { std::cout<<"array["<<i<<"] = "<<array[i]<<","; } std::cout<<std::endl; } template<typename T> void swap(T & a ,T & b) { T c = a; a = b; b = c; } template<typename T> void randomize(T * tarray ,int n) { T * array = new T[n]; std::copy(tarray,tarray+n,array); int i = n - 1; for(i;i>&#