This page is a good starting point:
This web page covers the spatial and temporal complexities of Big-O common algorithms used in computer science. When I was preparing for a technical interview in the past, I found that I spend hours crawling on the Internet, creating the best, medium, and worst complications for search and sorting algorithms so that I don't get stuck when asked. Over the past few years, I interviewed several Silicon Valley startups, as well as some large companies such as Yahoo, eBay, LinkedIn, and Google, and every time I got ready for an interview, I thought, “Why, why? Is anyone Didn't create a good Big-O cheat sheet? " So, to save you all the subtle people, I went ahead and created one.