@Kartik: That would be O(n), not o(n). Dave
On Nov 27, 11:41 pm, kartik sachan <kartik.sac...@gmail.com> wrote: > simply find max in o(n) by liner search then remove max then again find max > that will be second max........:P :P -- 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.
