Lab 7: STL

For this lab, we will be working with STL containers, iterators, and
algorithms.  The file that you turn in will have the same format as
the last few: small main() function, with a menu to test each of the
problems in turn. 

The menu should contain entries for the following problems, from
Chapter 18: 

Problem 1 (10 points): you needn't really know what a deque is, or the
other ways in which it can be used.  For this problem, you just need
to declare it, stick some numbers in it, and call sort. 

Problem 3 (20 points): this is one of my favorite problems of all
time. 

And the following problems:

(10 points) Create a vector of strings, where each string denotes a
playing card in a standard deck (A-K of each suit, 4 suits, 52 cards
total).  For instance, "Ace of clubs" or "Queen of spades".  Use the
random_shuffle STL algorithm to shuffle the cards, and then 'deal' 4 5
card hands (easiest way to do this, just print 4 lines, each of 5
cards). 

(10 points) Using iterators, check a string to see if it is either a
strict or weak palindrome.  A strict palindrome is one which is
exactly the same, forwards and backwards, including whitespace and
punctuation.  A weak palindrome is one which is the same, except for
white space or punctuation. 

Strict: "rats live on no evil star"
Weak: "Dumb mud"

(15 points extra credit) Using only iterators, and no loop (and
for_each counts as a loop), output everything in a vector of
integers. HINT: Use iterators.