Find Jobs
Hire Freelancers

Optimizing an recursive algorithm

€8-30 EUR

Closed
Posted about 6 years ago

€8-30 EUR

Paid on delivery
I have an algorithm for Tournament Matchmaking. Assumptions are: - Always an even number of teams - Always less disciplines than teams present Requirements are: - All teams must participate in each discipline ONCE and only once - Every team must only participate against another team ONCE in the whole tournament: That means with four teams: 1 2 3 4 And three disciplines Football Tennis Hockey The Macthmaking would be: Football: 1 vs 2 3 vs 4 Tennis 2 vs 3 4 vs 1 Hockey 1 vs 3 2 vs 4 The recursive pathfinder algorith works pretty efficient with this, but is very Big O sensible, so it is not efficient enough. I posted the current implementation of this algorith. Gets the work done, but with more than 18 teams and 8 disciplines it gets too slow. I am looking for an algorithm capable programmer to optimize this algorithm, to make it production ready.
Project ID: 16371628

About the project

8 proposals
Remote project
Active 6 yrs ago

Looking to make some money?

Benefits of bidding on Freelancer

Set your budget and timeframe
Get paid for your work
Outline your proposal
It's free to sign up and bid on jobs
8 freelancers are bidding on average €76 EUR for this job
User Avatar
Hello Sir, I am a computer science tutor, I teach (among others) Programming and Algorithms. I have done many projects like this, and I'm one of the top developers, and you can check by clicking on my profile picture. Please contact me for more details when possible. I look forward to work for you, Sir. Best Regards.
€90 EUR in 1 day
4.9 (80 reviews)
6.1
6.1
User Avatar
hi i am expert in algorithms and can do that work for you
€9 EUR in 1 day
2.3 (3 reviews)
2.7
2.7
User Avatar
Hello. I'm experienced in competitive programming - 1st place in Australia and 1% worldwide of IEEEXtreme Programming Competition. Therefore I am very experienced in algorithmic based questions. For this questions, these are my observations: 1. E.g there're 4 teams and 1 discipline, how can it satisfy "Every team must only participate against another team ONCE in the whole tournament:"? 2. Let's say we have m teams and n disciplines. Total number of matches would be (m/2)*n. 3. A way to solved this would be: - Iterate through all disciplines in a for loop. In that for loop, nest another for loop to iterate through the first team. Nested another for loop in that for the second team. This will put 1 vs 2, 1 vs 3, 1 vs 4, ... and then again 2 vs 3, 2 vs 4... - To check if a team has already been selected in an discipline, we can use an boolean array selected[discipline][teamNumber].
€23 EUR in 1 day
5.0 (1 review)
0.3
0.3
User Avatar
Hi There, I am a good algorithm writer. Your problem statement looks similar to the Round Robin Pairing Rules Which has been followed in conducting Professional Chess Tournaments. I have only one doubt. If you clear me that doubt I can provide you the best algorithm. My doubt is Whether the disciplines is always 1 less or it may also be more less for example. If there are 18 teams. Is there a possibility, that the disciplines will be 5 or 6 like that. Pleaseclarify me this doubt in Chat. I have created the algorithm. It's complexity is There will be (n/2)(n-1) matches. and n-1 loops.
€34 EUR in 1 day
0.0 (0 reviews)
0.0
0.0
User Avatar
Hi, would you like to go for the algorithm implemtation in Java. If yes them please send me message to discuss further. And after that if you would like, we can proceed further on developing an algorithm. P.S. Recursion has its own issues and being 7+ years experience in Java development, I could say that the recursion can be easily replaced by simple and more efficient algorithm. Bast Regards, Chinmayee
€22 EUR in 2 days
0.0 (0 reviews)
0.0
0.0

About the client

Flag of DENMARK
Albertslund, Denmark
4.7
5
Payment method verified
Member since Aug 2, 2013

Client Verification

Thanks! We’ve emailed you a link to claim your free credit.
Something went wrong while sending your email. Please try again.
Registered Users Total Jobs Posted
Freelancer ® is a registered Trademark of Freelancer Technology Pty Limited (ACN 142 189 759)
Copyright © 2024 Freelancer Technology Pty Limited (ACN 142 189 759)
Loading preview
Permission granted for Geolocation.
Your login session has expired and you have been logged out. Please log in again.