A program to test if a linked list has a loop. The list node has structure:
-------------
Implement the search, insertion, and delete operations for binary tree.
-----------------
Implement the search, insert, and delete operations for 2-3 tree
For the implementations of binary tree and 2-3 tree, do the tests below for m=1000,
10000, 100,000, 1,000,000,2000,000. Compare the performance between the binary
tree and 2-3 tree. Call the time function to measure the number of seconds as we did
:
a) Insert numbers by the order 1,2,3,…, m.
b) Delete numbers by the order m,m-1,m-2,…,2, 1 after inserting them.
c) Insert numbers a1,a2, a3, …,am, where each ai is a random number generated by
srand( ) function.
d) Sorting m elements.
view zip file for specs
## Deliverables
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.
2) Deliverables must be in ready-to-run condition, as follows (depending on the nature of the deliverables):
a) For web sites or other server-side deliverables intended to only ever exist in one place in the Buyer's environment--Deliverables must be installed by the Seller in ready-to-run condition in the Buyer's environment.
b) For all others including desktop software or software the buyer intends to distribute: A software installation package that will install the software in ready-to-run condition on the platform(s) specified in this bid request.
3) All deliverables will be considered "work made for hire" under U.S. Copyright law. Buyer will receive exclusive and complete copyrights to all work purchased. (No GPL, GNU, 3rd party components, etc. unless all copyright ramifications are explained AND AGREED TO by the buyer on the site per the coder's Seller Legal Agreement).
## Platform
Program must be in C, unix, visual C++ compatible