Sorting combination, AS to implement the exhaustive Algorithm

 

Principle:

 

The algorithm is as follows:

 

 

 

Private function compoud (N: uint, C: uint): void

{

Var pickIndex: int = 0;

Var X: int = 1;

Var Y: int = 1;

Var P: int = 1;

Var I: int = 0;

Var arr: Array = new Array ();

Var src: Array = new Array ();

For (I = 0; I <N; I ++)

{

Src. push (I + 1 );

}

While (true)

{

If (pickIndex <N)

{

Arr. push (src [pickIndex ++]);

If (arr. length = C)

{

Var tmp: String = "";

For (I = 0; I <C; I ++)

{

Tmp + = arr [I] + "";

}

Trace (tmp );

If (pickIndex = N)

{

Var backto: int =-1;

For (I = C-1; I> 0; I --)

{

If (arr [I]-arr [I-1]> 1)

{

Backto = I-1;

Break;

}

}

If (backto =-1)

{

Break;

}

PickIndex = arr [backto];

For (I = 0; I <C-backto; I ++)

{

Arr. pop ();

}

}

Else

{

Arr. pop ();

}

}

}

Else

{

Break;

}

}

}

 

From the aerror Column