[java] /**
* Description :
* Date :16.08.2003
* Status :
* @author Prashant Kumar(prashkr@iitk.ac.in ,kpras@email.com)
*/
import java.io.IOException;
import java.util.StringTokenizer;
class Main{
private String number;
Main(int number){
this.number = ""+number;
}
public static void main ...
Search found 2 matches
- Wed Aug 20, 2003 12:09 pm
- Forum: Volume 100 (10000-10099)
- Topic: 10018 - Reverse and Add
- Replies: 169
- Views: 43870
- Thu Jun 12, 2003 2:55 pm
- Forum: Algorithms
- Topic: How to Generate Distinct Combinations
- Replies: 8
- Views: 4184
Generating all permutations
Hi
This can be done using cyclisation and recursion ; Lets take a word
say code. You think of this word as placed as a circular array,
key for recursion is that all the words starting with c are : c added
in the start to all the permutations of the string "ode". similarly for
"ode" now. ...
Going ...
This can be done using cyclisation and recursion ; Lets take a word
say code. You think of this word as placed as a circular array,
key for recursion is that all the words starting with c are : c added
in the start to all the permutations of the string "ode". similarly for
"ode" now. ...
Going ...