and for finding missing 2 elements= O(n)+O(n)+O(n)+O(n) so total will be O(n) but there will be no overflow
On Mon, Jul 18, 2011 at 6:41 PM, Nishant Mittal <mittal.nishan...@gmail.com>wrote: > @ankit.... for removing duplicates=O(n)+O(n) > > > > On Mon, Jul 18, 2011 at 6:36 PM, ankit sambyal <ankitsamb...@gmail.com>wrote: > >> @nishant : Time complexity ?????? will increase too much >> >> -- >> 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. >> >> > -- 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.
