Starting Out with C++: Early Objects
Starting Out with C++: Early Objects
8th Edition
ISBN: 9780133360929
Author: Tony Gaddis, Judy Walters, Godfrey Muganda
Publisher: Addison-Wesley
Question
Book Icon
Chapter 9.6, Problem 9.11CP
Program Plan Intro

Complexity of an algorithm:

The complexity of an algorithm solves a computations problem by finding the number of basic steps required for an input.

Types of complexity:

  • Best-case complexity
  • Average case complexity
  • Worst-case complexity

Blurred answer
Students have asked these similar questions
Given a program designed to calculate rocket trajectories, the algorithm has an O(2n) complexity and takes 1 second for each iteration, and n = 15. How many hours will it take to calculate the trajectories, worst case?
What is the main difference between a linear and a non-linear algorithm?  Provide examples
What do you mean by "Worst case-efficiency" of an algorithm?

Chapter 9 Solutions

Starting Out with C++: Early Objects

Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Principles of Information Systems (MindTap Course...
Computer Science
ISBN:9781305971776
Author:Ralph Stair, George Reynolds
Publisher:Cengage Learning