johnson trotter algorithm




Comment hidden because of low score. Click to expand.
0
of 0 vote

If all you want to do is generate all permutations, there are simple, low space recursive algorithms. There are even non-recursive versions like std::next_permutation.

.

- Anonymous October 12, 2012 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 votes

heap permute algorithm is another one! but i want clue for this algorithm.

- BeautifulCode October 13, 2012 | Flag
Comment hidden because of low score. Click to expand.
0
of 0 votes

@Sushma: Did you try searching the web? The wiki seems to have some description...

- Anonymous October 13, 2012 | Flag




Add a Comment
Name:

Writing Code? Surround your code with {{{ and }}} to preserve whitespace.

Books

is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.

Learn More

Videos

CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.

Learn More

Resume Review

Most engineers make critical mistakes on their resumes -- we can fix your resume with our custom resume review service. And, we use fellow engineers as our resume reviewers, so you can be sure that we "get" what you're saying.

Learn More

Mock Interviews

Our Mock Interviews will be conducted "in character" just like a real interview, and can focus on whatever topics you want. All our interviewers have worked for Microsoft, Google or Amazon, you know you'll get a true-to-life experience.

Learn More