Quadratic time, denoted as O(n^2), describes an algorithm whose performance is directly proportional to the square of the size of the input data set. This time complexity is typically seen in algorithms that involve nested iterations over the data set, such as bubble sort or insertion sort for certain cases.