Show Bid Request
Max-Heapify
Bid Request Id: 18669
|
|
|
Posted by: |
sapphire (3 ratings)
(Software buyer rating 10)
|
Posted: |
Jun 9, 2002 4:05:57 PM EDT
|
Bidding Closes: |
Jun 10, 2002 6:07:37 PM EDT
|
Viewed (by coders): |
230 times
|
Deadline: |
6/11/2002
TIME EXPIRED
|
|
|
|
Description:
Write an efficient MAX-HEAPIFY that uses an iterative control construct (a loop) instead of recursion.
Deliverables: Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.
Complete copyrights to all work purchased.
Platform:
Must be able to run on VC++ 6.0
Must be 100% finished and received by buyer on:
Jun 11, 2002 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.
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, you can report it to: abuse@rentacoder.com.
|
|
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!
|
$13 (USD)
|
Jun 10, 2002 5:38:37 AM EDT
|
9.6
(Excellent)
|
|
|
Hello, Yes i can do this job very easily.You can check my ratings to see the previous job done with rentacoder. I would do this job before the deadline is over .Hoping to hear from you soon so that i can start the work as soon as possible.Please clarify it that is this program for Max-Heap, if it is so then i can do it very easily. |
|
|
|
|
|