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.
Jump to Post
Maybe this can help you: http://en.wikipedia.org/wiki/Analysis_of_algorithms
All 3 Replies
Be a part of the DaniWeb community
We're a friendly, industry-focused community of 1.21 million developers, IT pros, digital marketers, and technology enthusiasts learning and sharing knowledge.