You're given an array containing both positive and negative
integers and required to find the sub-array with the largest
sum (O(N) a la KBL). Write a routine in C for the above.
Answer Posted / gopika
how to get O(N) for above program
| Is This Answer Correct ? | 1 Yes | 0 No |
Post New Answer View All Answers
Why cout is used in c++?
Is swift faster than c++?
What are the uses of c++ in the real world?
what is scupper?
Why is c++ still popular?
What is a responder chain?
What is a .h file c++?
What is atoi?
If we want that any wildcard characters in the command line arguments should be appropriately expanded, are we required to make any special provision? If yes, which?
What is time h in c++?
What is cin clear () in c++?
What is unary operator? List out the different operators involved in the unary operator.
What is the difference between structure and class?
What is this weird colon-member (" : ") syntax in the constructor?
What is the benefit of c++?