Time Complexity Analysis is a basic function that every computer science student should know about. This fundamental concept is often used to define the usefulness of algorithms. Complexity analysis of an algorithm is defined as the rate at which an algorithm needs resources to complete as a function of its input. Complexity analysis is extensively used to compare and analyze algorithms and data structures. Algorithms are often expressed in terms of order complexity (like O(n), O(n^2), etc...). The term with the largest degree is used to predict how much time is required for an algorithm to complete processing. Time complexity is a function of time needed for an algorithm to complete as it's input changes, and space complexity is the space required for an algorithm as a function of it's input.