This paper by C++ Standard Committee member Howard Hinnant (great guy - replied to a few of my Stack Overflow questions on C++) is requisite reading for those interested in combinations and permutations.
He has a very efficient "for_each_permutation" algorithm which has better performance (orders of magnitude faster) than std::next/prev_permutation and it supports partial permutations. He also has algorithms for reversible and circular permutations. These are some of the hardest algorithms I've ever seen so he has my total respect.
General Discussion
- Caffeine Lounge
- Corner Cubicle
- Student Campus
- Software Development
- Industry News
- Introduce Yourself
- Nightmare.In.Code
Programming Help
- C and C++
- VB.NET
- Java
- C#
- ASP.NET
- .NET Framework
- VB6
- PHP
- Ruby
- Python
- ColdFusion
- Databases
- Other Languages
- Game Development
- Mobile Development
- 52 Weeks Of Code
Web Development
- Web Development
- HTML & CSS
- JavaScript
- Graphic Design
- Flash & ActionScript
- Blogging
- SEO & Advertising
- Web Servers & Hosting
- Site Check
Follow & Share
Give It A Try!
Tutorials
Programming
- C++ Tutorials
- Java Tutorials
- VisualBasic Tutorials
- VB.NET Tutorials
- C# Tutorials
- PHP Tutorials
- ColdFusion Tutorials
- Database Tutorials
Web Development
Reference Sheets
Code Snippets
- C++ Source Code
- Java Source Code
- C# Source Code
- VB.NET Source Code
- PHP Source Code
- C Source Code
- Visual Basic Source Code
- JavaScript Source Code
- Python Source Code
- Other Languages Source Code
DIC Chatroom
Bye Bye Ads
Monthly Drawing

New Topic/Question
Reply




MultiQuote
|