Need logic for this function
Write the following function in C.
stripos — Find position of first occurrence of a case-insensitive string
int stripos ( char* haystack, char* needle, int offset )
Returns the numeric position of the first occurrence of needle in the haystack string. Note that the needle may be a string of one or more characters. If needle is not found, stripos() will return -1.
The function should not make use of any C library function calls
Are you telling me I'm supposed to do it?Originally Posted by Sunil4u
At least you could have added something yourself.
Need logic only!!!!!!!!!!!
>> Need logic for this function
It's generally a good idea to post the code that you're working with.
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; }
What else is there ?Need logic only!!!!!!!!!!!
>> Need logic only!!!!!!!!!!!
Advance to 'offset'. If it's past the end, bail out. Starting there (let's call it position X), traverse haystack and needle in step until you reach the end of either one or the match fails. If you've reached the end of needle, then you've got a match, so return X. Otherwise, move on to the next character in haystack (X+1) and restart the search.
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; }
Code:#define OFFSET ('a' - 'A') int value(int c) { if(c >= 'a' && c <= 'z') return c - OFFSET; return c; } /* * While I am sure Professor X at your school has not gone over * const I am still going to use them for my own sanity. */ int stripos(const char* haystack, const char* needle, int offset) { int pos, i, j; for(pos = 0; offset-- && haystack[pos]; pos++) ; if(!haystack[pos]) return -1; do { for(i = pos, j = 0; value(haystack[i]) == value(needle[j]) && haystack[i] && needle[j]; i++, j++) ; if(needle[j] == '\0') return pos; if(haystack[i] == '\0') break; } while(haystack[++pos]); return -1; }
Just keep in mind that is generally better to post advise rather than code solutions. That way, the OP can learn to work out the problem himself rather than simply copy the code of others and, potentially, submit it as his own.
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; }
