Show Bid Request
Quic/Shell/Heap/Merge Sort Race(Repost)
Bid Request Id: 31639
|
|
|
|
Posted by: |
seatiger74 (25 ratings)
(Software buyer rating 10 )
|
|
Non-action Ratio: |
Very Good - 3.23%
|
Buyer Security Verifications: |
Good
|
|
Approved on: |
Oct 19, 2002
9:53:59 AM EDT
|
|
Bidding Closes: |
Oct 23, 2002
9:53:59 AM EDT
|
|
Viewed (by coders): |
151 times
|
|
Deadline: |
10/24/2002
TIME EXPIRED
|
|
|
|
|
Description:
Data Structures Assignmen (Write in C++)
QuickSort / ShellSort / Heapsort / Mergesort race
Write functions to implement QuickSort, ShellSort, Heapsort and Mergesort.
Use InsertionSort (for QuickSort) when the array
size gets small (use a #define CUTOFF 10, and vary this to see how to fine
tune things). Also use the median of 3 approach for partitioning. Use
Sedgewick's increments for ShellSort (I will list these below). Then
generate an array of 1,048,576 random integers, and reuse the first n of
these each time you run a sort. Get in a loop, and show the elapsed CPU
times for both sorts on each array size listed:
CPU Times
Array Size Quick Shell Heap Merge
65536 ... ... ... ...
131072 ... ... ... ...
262144 ... ... ... ...
524288 ... ... ... ...
1048576 ... ... ... ...
Here are Sedgewick's increments for ShellSort (up to the size we need):
1
5
19
41
109
209
505
929
2161
3905
8929
16001
64769
146305
260609
587521
1045505
I would put these in an array, and search backwards when the sort begins
to find the first one smaller than the array size to use as the first
increment.
Deliverables:
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.
2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request.
3) Complete ownership and distribution copyrights to all work purchased.
Platform:
Please write this program in C++. I use Visual C++ 6.0 to run it
Must be 100% finished and received by buyer on:
Oct 24, 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.
Special Conditions / Other:
Please send the codes ontime
10/24/2002
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!
|
$25 (USD)
|
Oct 19, 2002
1:53:21 PM EDT
|
8.74
(Superb)
|
|
|
Hello ,
Let me introduce myself as an expert at C and C++. I have worked extensively on data structures i.e linked lists , stacks, queues .. etc.
During my work experience with C++ I have worked extensively on various sorting algorithms and was even involved in preparation of a study paper for a student to demonstrate the advantage of one sorting algorithm over another.
I have worked on many data structures assignments on this site successfully with a rating of 10.
With the kind of experience I am having I can assure you of quality work first time and on time.
Looking forward to your response.
I will be giving you the completed work in VC++ 6.0
Kind Regards |
|
|
|
|
|
|