2. Well known problem and a simple solution: http://wuhrr.wordpress.com/2008/01/11/find-largest-sum-of-contiguous-numbers-in-an-array/ 1. a. Run 4 iterations of selection sort. b. Use quicksort based selection algorithm: http://www.ics.uci.edu/~eppstein/161/960125.html c. Use linear alorithm to find k-ordered statistic: http://en.wikipedia.org/wiki/Selection_algorithm
On 3 ноя, 09:21, kanika suri <surfatheig...@gmail.com> wrote: > 1.Given an array[0,n-1] of size n.Write an algorithm that finds the sum of > continuous subsequence that result in largest sum(among all such sequences) > and return 0 if all integers are zero or negative. > 2.Given a BST.Write an algorithm that finds the 4h smallest element.(is dere > ne approach odr than finding inorder traversal). > > -- > regards > kanika suri > MCS 2nd yr > DUCS > University of Delhi -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@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.
