Need help with my OOP programming assignment to deal a bridge hand using STL containers and algorithms. MUST use one container and one algorithm at least and try to reduce use of loops. Ex. using foreach to shuffle. Thanks!
Introduction The name of the card game Bridge' comes from Russian Whist, called "biritch," meaning announcer or herald. Bridge players announce their contract bids The game of bridge begins with shuffling and dealing a bridge hand. A bridge deal divides a 52-card deck into four hands of 13 cards each. The hands are labeled North, East, South and West. A bridge deck has four suits: Clubs, Diamonds, Hearts, and Spades. In each suit, the cards are labeled Ace, King, Queen, Jack, 10, 9, .., 2 Major bridge tournaments play with computer-generated hand Specific Instructions Write a program that initializes a deck of cards and simulates shuffling it and dealing a bridge hand. This involves dealing 5 cards to each player in the first round followed by two rounds of 4 cards each. Also, the user should be allowed repeated attempts for as long as You are to use STL containers and algorithms that you find appropriate. In particular, you are required to use at least one container, and one algorithm to implement this problem Use of iterators is highly encouraged. Kindly remember that the STL algorithm is not a method of the container. Additionally, attempt to eliminate all loops (e.g. for or while loops) from the application This assignment will include a section where you will justify the use of the container you chose. This should include details of the time complexity of the methods involved. Include all the source code (well documented) and sufficient representative output. You encouraged to use assertions/exception handling and unit testing. Introduction The name of the card game Bridge' comes from Russian Whist, called "biritch," meaning announcer or herald. Bridge players announce their contract bids The game of bridge begins with shuffling and dealing a bridge hand. A bridge deal divides a 52-card deck into four hands of 13 cards each. The hands are labeled North, East, South and West. A bridge deck has four suits: Clubs, Diamonds, Hearts, and Spades. In each suit, the cards are labeled Ace, King, Queen, Jack, 10, 9, .., 2 Major bridge tournaments play with computer-generated hand Specific Instructions Write a program that initializes a deck of cards and simulates shuffling it and dealing a bridge hand. This involves dealing 5 cards to each player in the first round followed by two rounds of 4 cards each. Also, the user should be allowed repeated attempts for as long as You are to use STL containers and algorithms that you find appropriate. In particular, you are required to use at least one container, and one algorithm to implement this problem Use of iterators is highly encouraged. Kindly remember that the STL algorithm is not a method of the container. Additionally, attempt to eliminate all loops (e.g. for or while loops) from the application This assignment will include a section where you will justify the use of the container you chose. This should include details of the time complexity of the methods involved. Include all the source code (well documented) and sufficient representative output. You encouraged to use assertions/exception handling and unit testing
