I think Dave has already given a good solution in earlier post. first make a max heap of first k elements and then print max value which is root . now add next element in heap and again print max value follow this procedure till you reach end of an array.
On Fri, Sep 2, 2011 at 9:04 AM, Anup Ghatage <ghat...@gmail.com> wrote: > Given an unsorted Array A and any integer k where k <= size of A > > Print the maximum of each sub-array of size k of A. > > eg: A = [ 3, 5, 1, 9, 0, 4, -1, 7 ] k = 4 > Max: 9 9 9 9 7 > > -- > Anup Ghatage > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
