In this lesson, we have solved another famous programming interview question - finding maximum sub-array sum in an array.
See source codes here:
O(n^3) algorithm - https://gist.github.com/mycodeschool/...
O(n^2) algorithm -
https://gist.github.com/mycodeschool/...
O(NlogN) algorithm -
https://gist.github.com/mycodeschool/...
O(N) algorithm -
https://gist.github.com/mycodeschool/...
See playlist on programming interview questions here:
• Programming Interview Questions
See series on time complexity here:
• Time complexity of a computer program
Analysis of quicksort:
• Analysis of quicksort
You may also like/follow us on Facebook/Twitter:
/ mycodeschool
/ mycodeschool
Video creator : Ashwin Krish - intern at MyCodeSchool
On this page of the site you can watch the video online Maximum sum sub-array with a duration of hours minute second in good quality, which was uploaded by the user mycodeschool 23 June 2014, share the link with friends and acquaintances, this video has already been watched 389,258 times on youtube and it was liked by 3.2 thousand viewers. Enjoy your viewing!