max sub array Algorithm

binary heaps are also normally used in the heapsort sorting algorithm, which is an in-place algorithm because binary heaps can be implemented as an implicit data structure, storing keys in an array and use their relative positions within that array to represent child-parent relationships. The binary heap was introduced by J. W. J. Williams in 1964, as a data structure for heapsort.

max sub array source code, pseudocode and analysis