Member Avatar for abhinavupadhyay

<<Thread split from here>>

Can anyone help me out on the topic of analysis of algorithms? I am not able to understand how is time complexity calcuated? how come time complexity for the step: set S<-- P is n-1?

Edited by Nick Evan because: n/a
  • 2 Contributors
  • 1 Reply
  • 33 Views
  • 2 Days Discussion Span
  • Latest Post Latest Post by BestJewSinceJC
Member Avatar for BestJewSinceJC

what is S and what is P? Is that a new question?

Be a part of the DaniWeb community

We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.