i cant find the general algorithm for recursive subset
on google
??
This is a discussion on subset recursive algorithm within the General Discussions forums, part of the Community Boards category; i cant find the general algorithm for recursive subset on google ??...
i cant find the general algorithm for recursive subset
on google
??
No?
Really?
You don't say.
If you dance barefoot on the broken glass of undefined behaviour, you've got to expect the occasional cut.
If at first you don't succeed, try writing your phone number on the exam paper.
I support http://www.ukip.org/ as the first necessary step to a free Europe.
Your Google must be broken
hint: Not every assignment you get can be solved by typing the problem into Google. The idea of getting assignments is to solve a problem yourself. i.e. You learn what the problem is and then you write your own algorithm.
Maybe even google has gotten bored with all the pointless questions
If you dance barefoot on the broken glass of undefined behaviour, you've got to expect the occasional cut.
If at first you don't succeed, try writing your phone number on the exam paper.
I support http://www.ukip.org/ as the first necessary step to a free Europe.
??????????
this is not a pointless question
What makes you say that, exactly? Because I've never heard of the "general algorithm for recursive subsets", and apparently neither has anyone whose work is indexed by Google. That gives me a pretty good assurance that your question is pointless. Also, the manner in which it has been asked gives me a pretty good assurance that helping you find an answer is going to be pointless.this is not a pointless question
If you've been given an assignment, why are you looking online for the algorithm? That's not going to teach you anything. And how do you expect us to solve the problem with a phrase that doesn't exist and no specifics? You really haven't learned anything.
What you need to do is explain the whole problem, including where you heard this phrase, and what you are trying to accomplish. You also need to make a serious attempt to solve this problem yourself - you should've seen by now that if you don't learn by doing, anything we tell you is useless.
i dont have any assignment
i need to understand the subset recursive algorithm
and i didnt find it i good
and its not pointless
No single algorithm exists. A subset is recursive if there exists an algorithm that can determine if a number is a member of that set in a finite amount of time (that's according to the first google result). So there's potentially billions of "subset recursive algorithms". Do you see now why that's a pointless question, and why you need to explain more?i need to understand the subset recursive algorithm
...and i didnt find it i good
and its not pointless
I'm pretty sure that someone was working on this on cboard a few weeks ago. Alternatively, Teh Codez.com
I copied it from the last program in which I passed a parameter, which would have been pre-1989 I guess. - esbo
Code:#include <cmath> #include <complex> bool euler_flip(bool value) { return std::pow ( std::complex<float>(std::exp(1.0)), std::complex<float>(0, 1) * std::complex<float>(std::atan(1.0) *(1 << (value + 2))) ).real() < 0; }
lol dude
vis. the secret algorithm, maybe this one is a better source:
http://www.sindominio.net/ayuda/preg...eligentes.html
C programming resources:
GNU C Function and Macro Index -- glibc reference manual
The C Book -- nice online learner guide
Current ISO draft standard
CCAN -- new CPAN like open source library repository
3 (different) GNU debugger tutorials: #1 -- #2 -- #3
cpwiki -- our wiki on sourceforge