Interested to Buy Any Domain ? << Click Here >> for more details...
Give an algorithm for the following problem and determine
its time complexity. Given a list of n distinct positive
integers, partition the list into two sublists, each of
size n/2, such that the difference between the sums of the
integers in the two sublists is maximized. You may assume
that n is a multiple of 2 (i.e. n is even).
- 1 Answers
- 8426 Views
- I also Faced
- E-Mail Answers
Answer Posted / ali
In the case of T(n) = n, say O(n), and n is 1000, then on
the old computer 1 minute and the new one, 1/1000 minute
For T (n) =n3, the size will be 1000^3 = 1000,000,000 which
takes 1000,000 minutes on the old computer and 1000 on the
new one
For T(n)=10n Because of the limited space, I won’t write
1000 ZEROs here, instead it’s clear that it takes 10^997
minutes on the old computer, and 10^994 minutes on the new one.
| Is This Answer Correct ? | 3 Yes | 19 No |
Post New Answer View All Answers
what is compiler
Is Diesel staorage tank ( 800 litres) cleaning procedure is available with any body
What is "strstream" ?
successful command to make linux system as router in redhat-+
what is the difference between verification and validation
Explain Belady's Anomaly.
what is the difference between composite key and primary key in sap abap
hi i have selected for nda and could please send me the courses offered in nda regarding engineering and all other courses????
what do you expect from this company?
What kind of question can be asked at the time of Interview for State Bank Of India Clerical Interview
which field is comparitively very best , today and in future while considering the following : ELECTRONICS [OR] NETWORKING
what do you mean by CPU register?
can oracle driver be directly connected with odbc driver??
Can one be shocked holding a wire carrying a very large current with a low voltage source?
how many E1's in pasolink and ipasolink?
