# Computational Complexity

**Tutor description**

Our goal is to be able to compare algorithms and determine which is the most “eï¬ƒcient”. When we calculate the eï¬ƒciency of an algorithm, we are essentially trying to quantify how computer resources are required. And the two most important computer resources are time and memory. Usually this is referred to as the computational complexity of the algorithm, and Time complexity is an analysis of the amount of time required to solve a problem of a particular size, while the Space complexity is an analysis of the amount of memory required. For the most part, we take computational complexity to mean Time complexity . CS204/209 — Lecture 4: Best, Worst, and Average Case Complexity 2/11

## Review from student

Brown University

1271 Tutors

California Institute of Technology

2131 Tutors

Carnegie Mellon University

982 Tutors

Columbia University

1256 Tutors

Dartmouth University

2113 Tutors

Emory University

2279 Tutors

Harvard University

599 Tutors

Massachusetts Institute of Technology

2319 Tutors

New York University

1645 Tutors

Notre Dam University

1911 Tutors

Oklahoma University

2122 Tutors

Pennsylvania State University

932 Tutors

Princeton University

1211 Tutors

Stanford University

983 Tutors

University of California

1282 Tutors

Oxford University

123 Tutors

Yale University

2325 Tutors