Please don't spend more than 1-2 hours on this. Show us your best coding & documentation style - the way you like to write code.
You are given a list of integers, both positive and negative. Each integer in the list must either be paired with another element in the list or be a single element. Once the elements have been paired, the integers in the pairs are multiplied and the results are summed up - the sum will include the single elements.
Write a program to find the biggest possible sum.
for the list [0,1,2,3,4,5] the pairs (4,5) and (2,3) are formed and 0 and 1 are single elements. The max. sum is 27 - (20+6+0+1).
for the list [-1,0,1] the pairs (-1,0) is formed and 1 is a single element. The max. sum is 1.
for the list [1,1] no pairs are formed only two single elements. The max. sum is 2. You choose the implementation language and how input/output is handled etc.
27 freelancere byder i gennemsnit $93 på dette job
A simple optimal algorithm in linear time O(n) for sorted array or O(n*log(n)) for unsorted. It was tested for millions of generated cases by comparing with a slow but reliable reference algorithm.
Algorithm expert. I have many experiences. I can complete your project successfully. I'm software engineer and algorithm expert. I'm fullstack website developer and database manager. Thanks.
Hi Glad to see you I am good at math and logic I have experience in ACM I can assure you good results Please ping me and let's discuss in detail Thanks Regards
Hi I have read your requirement very carefully. So I am really confidence your project. I have rich experiences with C and C++. I can finish your project with high quality in time. Hope your kind contact. Best regards!
I am a computer engineering student and i have done these problems before, let me know if you want me to do this, payment will be discussed on chat.