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.
