A* to sort four values in Java
$30-45 USD
Paid on delivery
Problem: It considers a tray formed for four made use houses on-line and a number of separated pieces numbered. Initially the board has the pieces randomly distributed, one per household. The aim is to obtain a sequence of ordered parts, in ascending order from left to right of the board, with minimum cost. To do this, you can switch between two pieces themselves, at a cost equal to the higher value of the two pieces exchanged. For example, the initial board 9 1 5 0 Leads the following configuration with the minimum cost of 9: 0 1 5 9 I need use A* to resolve the problem. Get those 4 nombers from a text file. That text file is an argument when we call the program
## 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
Windows, Linux
Project ID: #3432130