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.
- 4 Answers
- 11150 Views
- I also Faced
- E-Mail Answers
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
What is ostream in c++?
Explain bubble sorting.
Why is main an int?
What is late binding c++?
What are the two types of polymorphism?
What are pointer-to-members? Explain.
Show the application of a dynamic array with the help of an example.
Write a program using display() function which takes two arguments.
What is private inheritance?
What do manipulators do?
Write about the stack unwinding?
What are the various oops concepts in c++?
What is the purpose of the "delete" operator?
Which bitwise operator is used to check whether a particular bit is on or off?
Explain the different access specifiers for the class member in c++.
