how do i conduct a search in linked list to return all strings starting with the letter provided.. eg search('a',p) should return all words staring with a in the list p
i got this but its wrong..how do i fix it ??Code:int search(char check,Node *p) { while( p!= NULL ) { if(p->word == check) { printf("%s",p->word); } p = p->next; } return 0 ; }
>> p->word
What is Node::word?
>> i got this but its wrong
Yes, it is. But why? Could it be that char* == char doesn't make any sense?
>> int search
>> return 0 ;
Why return anything, if the value isn't even going to be returned properly?
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; }
yea..i know..but how do i search for the first char ? and then return the corresponding word ?
>> yea..i know
If you know then please show the updated draft.
>> but how do i
You can start by asking *specific* questions.
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; }
still doesnt work!..i know its wrong though..stcmp compares string..but i need to comapare a char to a string ?..how do i do that ?Code:int search(char* check,Node *p) { while( p!= NULL ) { if(strcmp(p->word,check)==0) { printf("%s",p->word); } p = p->next; } return 0 ; }
Last edited by rocketman03; 11-22-2008 at 04:17 PM.
Convert the char into a string and use strcmp( ), or just compare the char with the first character in the string and check that the string has a length of 1.
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; }
