Random commentary about Machine Learning, BigData, Spark, Deep Learning, C++, STL, Boost, Perl, Python, Algorithms, Problem Solving and Web Search
Sort the list in reverse order using QuickSort (worst case O(n*log(n))) and then largest sum will be A[0] + A[1]
no. c must be in A. otherwise is trivial
Sort the list in reverse order using QuickSort (worst case O(n*log(n))) and then largest sum will be A[0] + A[1]
ReplyDeleteno. c must be in A. otherwise is trivial
ReplyDelete