This webpage provides a useful Big-O complexity chart for common algorithms used in Computer Science, covering their space and time complexities. The chart includes various data structure operations such as Access, Search, Insertion and Deletion, as well as common Array Sorting algorithms like Quicksort, Mergesort, Timsort and Heapsort. The chart is designed to help technical interview preparation and has been created by Eric Rowell, who has interviewed at several Silicon Valley startups and larger companies such as Google, Facebook, Yahoo, LinkedIn, and Uber. The chart has been contributed to by a number of individuals, including Quentin Pleple, Michael Abed and Nick Dizazzo.
