Regarding time complexity of erase in std::set

Revision en2, by divyanshuGupta, 2020-08-07 09:15:04

Is there any massive time complexity difference between erasing a value from the set using -- set_name.erase(iterator) and set_name.erase(set_name.find(iterator)) when we are sure that iterator refers to a value present in the set..i am asking this because this shows time limit exceeded but thisone does not shows any time limit exceeded ...please help

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en5 English divyanshuGupta 2020-08-07 09:18:18 0 (published)
en4 English divyanshuGupta 2020-08-07 09:17:34 1 Tiny change: '/89176787)one does n' -> '/89176787) one does n'
en3 English divyanshuGupta 2020-08-07 09:16:47 14
en2 English divyanshuGupta 2020-08-07 09:15:04 22
en1 English divyanshuGupta 2020-08-07 09:12:39 528 Initial revision (saved to drafts)