Show Bid Request Bags, Trees and Performance Bid Request Id: 58287 Bookmark in my 'To Do' list Posted by: shaz (2 ratings) (Software buyer rating 10) Non-action Ratio: Very Good - 0.00% Buyer Security Verifications: Good Approved on: Apr 17, 2003 10:09:00 AM EDT Bidding Closes: Apr 20, 2003 9:13:44 AM EDT Viewed (by coders): 101 times Deadline: 5/1/2003 TIME EXPIRED Phase: 100% of work completed and accepted. Coder has been paid. Max Accepted Bid: Bidding is closed Project Type: Personal Project / Homework Help Bidding Type: Open Auction Categories: C++ / C Enter chat room for this bid request (0 active users at Jul 15, 2003 10:13:11 PM EDT) Description: BACKGOUND For this piece of work there will be a need for a bag data type. A bag is defined as a collection of items of the same type, with the following methods: 1) Create a new bag 2) add an element to the bag 3) count how often a specified item appears in the bag 4) count how many items are in the entire bag 5) print the contents of the bag PART A: IMPLEMENTATION 1)Create a template Binary Search Tree class TBST. you should adapt the code supplied. NOTE: you do not need to implement the deleteFromBST function. 2) Use TBST to implement a bag class (TBag) that holds characters. PART B: DISCUSSION 1) Compare your implementation in PART A with the array-based approach also supplied. you should discuss Bid(O) time and space growth rates, and any other performance factors you consider important 2) The TBag could also be implemented using the STL List class. Outline such an implementation, and discuss how this might affect the bag's performance. NOTE: you are not required to provide woking code in this case. 3) Briefly discuss why neither of the above implementatons work for all types of data, and suggest a change to your implementation to achieve a completely general template Deliverables: 1) Complete and fully-functional working program in executable form as well as complete source code of all work done. The source code should be implemented as outlined in PART A of description 2) All three written components dicussing as outlined in PART B of description Platform: unix or windows Must be 100% finished and received by buyer on: May 1, 2003 EDT Deadline legal notes: All times are expressed in the time zone of the site EDT (UT - 5). If the buyer omitted a time, then the deadline is 11:59:59 PM EDT on the indicated date. Additional Files: This bid request includes IMPORTANT additional attached files. Please download and read fully before bidding. Remember that contacting the other party outside of the site (by email, phone, etc.) on all business projects < $500 (before the buyer's money is escrowed) is a violation of both the software buyer and seller agreements. We monitor all site activity for such violations and can instantly expel transgressers on the spot, so we thank you in advance for your cooperation. If you notice a violation please help out the site and report it. Thanks for your help.   Bidding/Comments: All monetary amounts on the site are in United States dollars. Rent a Coder is a closed auction, so coders can only see their own bids and comments. Buyers can view every posting made on their bid requests. See all rejected bids (and all comments) Name   Bid Amount    Date   Coder Rating   This bid was accepted by the buyer! DanD (40 ratings) in Bucuresti, Bucharest Romania Bid id: 627,814   $15 (USD) Apr 17, 2003 12:24:24 PM EDT  9.35 (Superb)     I can solve this project for you in one day or less since your acceptance of my bid. If you want your project to be done by a proffesional programmer you should consider this as a winning bid. Please take a look at my ratings and especially at the number of my satisfied clients. Best regards, Dan Durbaca.           See 2 private reply(ies) to/from DanD.