Maximum sum sub-array

Описание: 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