On 6 September 2016 at 05:45, Avinash Gupta <avinashk...@gmail.com> wrote: > 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
It is unlikely that you will get anyone to help with your course work if you just copy/paste the requirement here. If you try to do it yourself but come across a particular issue that you would like help with then I am sure someone will help. Colin -- 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/CAL%3D0gLsBxHYqEyfGkGLKUV%3D2MBfq2v_nmJJJyaPNnZ9GoZaG_g%40mail.gmail.com. For more options, visit https://groups.google.com/d/optout.