An algorithm takes 1 second to execute for an input size of 10. What will the largest size of
input be that can be executed in 25 seconds if the running time is quadratic (N2)? Can i also have links to literature that can give me clear examples or explanations, i can follow through.
All 3 RepliesReply to this topic
Be a part of the DaniWeb community
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, learning, and sharing knowledge.