C# .net function for all permutation generation, Read attached file
$10-30 USD
Terminado
Publicado hace más de 8 años
$10-30 USD
Pagado a la entrega
I am looking for a "fast" c# function that will generate all possible combinations of books based on value and cost not exceeding a max cost for list of n list. Read the attached document for details ([login to view URL]). This function should be easy to understand, and scalable. This is a simple job, but I don't have time to do it and make it fast. I need it for tomorrow.
Hi, my algorithm is very fast I can finish and show a video of it working, before you assign me the job.
Just message me and ask me to record it to you.
Good day!
$30 USD en 1 día
0,0 (0 comentarios)
0,0
0,0
9 freelancers están ofertando un promedio de $38 USD por este trabajo
CAN AND WILL START NOW!
Hi there, my name is Oshane and I am a Professional Programmer and Web Application Developer with 4 years of experience.
I have read the word file and I have an understand of what is required. Like you said, it's simple and I just might have it ready in an hour or 2.
Please send me a message so that we can discuss and get started.
Looking forward to your response.
Regards
Hi. I am a Senior VB6, VBA and VB.NET and C# WPF and WINFORMS Developer living in Paris,
I have read your specifications and i want to realize your application.
i have already developed several applications you can find in my folio.
I need more details on your project requirements
You can contact me for any questions else.
Kind regards
hello sir i know i have little bit late bid but i am able to take this job i m new in the freelacner but it what i can think to build a long term relation with you to do your project and give you on time
thanks
Hi. I have started writing your function with some modular touch, Open-Close principle and DI. The objective is to make it cleanly separated from calling function, and minimize the unnecessary dependencies. Please prove me 6 hours as I need some rest now and get your codes.
That's all for now. Thank you.
Subhadeep