my code used vector and kind of long for its simple task, thought so there just some additional to the program, and thnx for the writing titled “George Orwell and Effective Coding”, very inspirational…

srry for bad grammar, by non-native english person ;)

1. Folks won’t read the emails, they won’t offer opinions if they do, and the manager loses track of the suggestions and who’s contributing if there’s no visibility.

2. It’s much easier to paint a rosy picture of things going well in an email update than face-to-face, where body language or buckling under questions often gives more info about what’s *really* done.

3. I think you misunderstand the purpose of status meetings. They’re not for the rote reporting of status to manager, they’re to foster conversations, thoughts, and knowledge transfer among the *team*. Not being “engaged” just because the task being discussed isn’t “yours” is unprofessional. While your dedication to writing code and being efficient is admirable, the dereliction of team obligations is anything but. Maybe there’s a slightly different expectation in your contractor role, but as a manager myself I expect team members to be “engaged” on everything the team is working on and the weekly meeting is the bare minimum time to show that. If you don’t know what’s being talked about, I’d strongly suggest learning – as it’s obviously important to the team.

That being said – emailed project updates are reasonable to avoid taking time from the meeting. But then, how to facilitate the conversation among otherwise reticent developers to open up and share “their” project info in a public setting?

#include <istream>
#include <string>
#include <vector>
#include “read_words.h”

using std::vector; using std::endl; using std::istream;
using std::string;

istream& read_words(istream& in, vector<string>& words)
{
if (in)
{
words.clear();
string word;

while (in >> word)
{
words.push_back(word);
}

in.clear();
}

return in;
}

The function to determine if the word is a palindrome

#include <string>
#include “palindrome.h”

using std::string;

bool palindrome(string s)
{
// Compare the first and last letter. Then increment i and decrement j
// to compare the second and second to last letter. Repeat until i != j
// or until a palindrome is confirmed
for (string::const_iterator i = s.begin(), j = s.end() – 1; i < j; ++i, –j)
{
if (*i != *j)
return false;
}

return true;
}

And main()!

#include <iostream>
#include <string>
#include <vector>
#include “palindrome.h”
#include “read_words.h”

using std::cout; using std::cin; using std::endl;
using std::vector; using std::string;

int main(void)
{
cout << "Enter the list of words you wish to check for palindromes, "
<< endl << "followed by end-of-file: ";

vector<string> words;
while (words.empty())
read_words(cin, words);

string::size_type maxlen = 0;
string longest;

cout << endl << endl;

// Start at the first word in the vector and output each palindrome
// immediately after they have been found
for (vector<string>::const_iterator it = words.begin();
it != words.end(); ++it)
{
if (palindrome(*it))
{
cout << *it <length() > maxlen)
{
maxlen = it->length();
longest = *it;
} // end inner if

} // end outer if

} // end for

cout << "The longest palindrome is: " << longest << endl;

return 0;
}

Our friend read_words is back!

#include
#include
#include
#include "read_words.h"

return in;
}

I did a little extra with the function to find ascenders and descenders. The only function you actually need is the one at the bottom “ascende_descende”, but I figured why not add functions to find them separately in case that was ever needed

#include
#include
#include "ascenders_descenders.h"

return false;
} // end ascende_descende()

And lastly, main() which is only using the ascende_decende() function

#include
#include
#include
#include "ascenders_descenders.h"
#include "read_words.h"

return 0;
} // end program

And an example run

Input desired words, followed by end-of-file. The program will then locate and
print words with "ascenders" or "descenders": output
nope
no
zoos
roar
rawr
konichiwa

The longest word containing no "ascenders" or "descenders" is: zoos