Write a RoR program to find the contiguous subarray within a onedimensional array of numbers (containing at least one positive number) which has the largest sum. For example, for the sequence of values −2, 1, −3, 4, −1, 2, 1, −5, 4; the contiguous subarray with the largest sum is 4, −1, 2, 1, with sum 6. The program should run as follows <bold is user entry>: Enter the array : 2 1 3 4 1 2 1 5 4 Largest SubArray Start Index: 3 Length: 4 Sum: 6 Elements: 4 1 2 1
kindly assist me to solve the problem -- You received this message because you are subscribed to the Google Groups "Ruby on Rails: Talk" group. To unsubscribe from this group and stop receiving emails from it, send an email to rubyonrails-talk+unsubscr...@googlegroups.com. To post to this group, send email to rubyonrails-talk@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/rubyonrails-talk/3ae76286-4fb7-4a8f-80b3-d5ce06da6867%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
