lol all you want, then when you're finished... go program in C. C is not C++, get over it.
That paragraph of supposed "facts" is nothing but opinion and poor assumptions based on insufficient data. The absolute LAST thing I would do is get into a freaking language war; its apples and oranges. Like I said, if you don't like it, go program in C.
I can write a "permutation program" in less than five minutes using C++.
These functions exist in the standard library:
prev_permutation
next_permutation
I also dare say that they're pretty fast.
Last edited by Sang-drax : Tomorrow at 02:21 AM. Reason: Time travelling
Maybe if you want to use strcat() you can do this:
if you have x, y, w as strings, and you want to put x and y in w.
or you can change the order but I think it will do the jubCode:strcat(w,y); strcat(w,x);
sangdrax, you sure those are iso standard? Well, guess that doesn't matter. Not bad for c++.
Yeah, eibro, i'll go program in C. I wouldn't post this, except that you say i'm putting those forth as "Facts". Never said that. Put that forward as my opinion, and at this moment in time I stand by it.
.sect signature
Yes. This is a quote from the ISO/IEC standard specification:Originally posted by ggs
sangdrax, you sure those are iso standard? Well, guess that doesn't matter. Not bad for c++.
25.3.9 Permutation generators
1 Effects:Code:template<class BidirectionalIterator> bool next_permutation(BidirectionalIterator first, BidirectionalIterator last); template<class BidirectionalIterator, class Compare> bool next_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp);
[...]
3 Effects:Code:template<class BidirectionalIterator> bool prev_permutation(BidirectionalIterator first, BidirectionalIterator last); template<class BidirectionalIterator, class Compare> bool prev_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp);
[...]
Last edited by Sang-drax : Tomorrow at 02:21 AM. Reason: Time travelling
