Bigocheatsheet | Time Complexity | Discrete Mathematics

Big-O Cheat Sheet

1.7k
Tw eet

5.1k
Like

I receive

$7.50 / wk
on Gittip.

Know Thy Complexities!
Hi there! This webpage covers the space and time Big-O complexities of common algorithms used in Computer Science. When preparing for technical interviews in the past, I found myself spending hours crawling the internet putting together the best, average, and worst case complexities for search and sorting algorithms so that I wouldn't be stumped when asked about them. Over the last few years, I've interviewed at several Silicon Valley startups, and also some bigger companies, like Yahoo, eBay, LinkedIn, and Google, and each time that I prepared for an interview, I thought to myself "Why oh why hasn't someone created a nice Big-O cheat sheet?". So, to save all of you fine folks a ton of time, I went ahead and created one. Enjoy!
Good Fair Poor

Searching
Space

open in browser PRO version

Are you a developer? Try out the HTML to PDF API

pdfcrowd.com

Algorithm

Data Structure

Time Complexity Average Worst
O(|E| + |V|)

Complexity Worst
O(|V|)

Depth First Search (DFS)

Graph of |V| vertices and |E| edges Graph of |V| vertices and |E| edges Sorted array of n elements Array Graph with |V| vertices and |E| edges

-

Breadth First Search (BFS)

-

O(|E| + |V|)

O(|V|)

Binary search

O(log(n))

O(log(n))

O(1)

Linear (Brute Force) Shortest path by Dijkstra, using a Min-heap as priority queue Shortest path by Dijkstra, using an unsorted array as priority queue Shortest path by BellmanFord

O(n) O((|V| + |E|) log |V|)

O(n) O((|V| + |E|) log |V|)

O(1) O(|V|)

Graph with |V| vertices and |E| edges

O(|V|^2)

O(|V|^2)

O(|V|)

Graph with |V| vertices and |E| edges

O(|V||E|)

O(|V||E|)

O(|V|)

Sorting
Algorithm Data Structure Time Complexity Best Average Worst Worst Case Auxiliary Space Complexity Worst

open in browser PRO version

Are you a developer? Try out the HTML to PDF API

pdfcrowd.com

com .Quicksort Array O(n log(n)) O(n log(n)) O(n log(n)) O(n log(n)) O(n^2) O(n^2) O(n) Mergesort Array O(n log(n)) O(n log(n)) O(n log(n)) O(n^2) O(n) Heapsort Array O(n log(n)) O(1) Bubble Sort Insertion Sort Select Sort Bucket Sort Radix Sort Array O(n) O(1) Array O(n) O(n^2) O(n^2) O(1) Array Array O(n^2) O(n+k) O(n^2) O(n+k) O(n^2) O(n^2) O(1) O(nk) Array O(nk) O(nk) O(nk) O(n+k) Data Structures Data Structure Time Complexity Average Indexing Basic O(1) Space Complexity Worst Worst Search O(n) Search O(n) Insertion - Deletion - Indexing O(1) Insertion - Deletion O(n) open in browser PRO version Are you a developer? Try out the HTML to PDF API pdfcrowd.

Array Dynamic Array SinglyLinked List DoublyLinked List Skip List O(1) O(n) O(n) O(n) O(1) O(n) O(n) O(n) O(n) O(n) O(n) O(1) O(1) O(n) O(n) O(1) O(1) O(n) O(n) O(n) O(1) O(1) O(n) O(n) O(1) O(1) O(n) O(log(n)) O(log(n)) O(log(n)) O(log(n)) O(n) O(n) O(n) O(n) O(n log(n)) Hash Table Binary Search Tree Cartresian Tree B-Tree Red-Black Tree Splay Tree AVL Tree - O(1) O(1) O(1) - O(n) O(n) O(n) O(n) O(log(n)) O(log(n)) O(log(n)) O(log(n)) O(n) O(n) O(n) O(n) O(n) - O(log(n)) O(log(n)) O(log(n)) - O(n) O(n) O(n) O(n) O(log(n)) O(log(n)) O(log(n)) O(log(n)) O(log(n)) O(log(n)) O(log(n)) O(log(n)) O(log(n)) O(log(n)) O(log(n)) O(log(n)) O(log(n)) O(log(n)) O(log(n)) O(log(n)) O(n) O(n) - O(log(n)) O(log(n)) O(log(n)) - O(log(n)) O(log(n)) O(log(n)) O(n) O(log(n)) O(log(n)) O(log(n)) O(log(n)) O(log(n)) O(log(n)) O(log(n)) O(log(n)) O(n) open in browser PRO version Are you a developer? Try out the HTML to PDF API pdfcrowd.com .

Heaps Heaps Time Complexity Extract Max O(1) Heapify Linked List (sorted) Linked List (unsorted) Binary Heap Binomial Heap Fibonacci Heap - Find Max O(1) Increase Key O(n) Insert O(n) Delete O(1) Merge O(m+n) - O(n) O(n) O(1) O(1) O(1) O(1) O(n) O(1) O(log(n)) O(log(n)) O(log(n)) O(log(n)) O(m+n) - O(log(n)) O(log(n)) O(log(n)) O(log(n)) O(log(n)) O(log(n)) - O(1) O(log(n))* O(1)* O(1) O(log(n))* O(1) Graphs Node / Edge Management Adjacency list Storage Add Vertex Add Edge Remove Vertex O(|V| + Remove Edge O(|E|) Query O(|V|+|E|) O(1) O(1) O(|V|) open in browser PRO version Are you a developer? Try out the HTML to PDF API pdfcrowd.com .

so that's why it's referred to as a tight bound (it must be both the upper and lower bound). Here the growth rate is no faster than g(n). For example. [3] Same thing. tightness unknown upper. Theta requires both Big O and Omega. the growth rate of f(x) is asymptotically proportional to g(n). open in browser PRO version Are you a developer? Try out the HTML to PDF API pdfcrowd. an algorithm taking Omega(n log n) takes at least n log n time but has no upper limit.|E|) Incidence list Adjacency matrix Incidence matrix O(|V|+|E|) O(|V|^2) O(|V| ⋅ |E|) O(1) O(|V|^2) O(|V| ⋅ |E|) O(1) O(1) O(|V| ⋅ |E|) O(|E|) O(|V|^2) O(|V| ⋅ |E|) O(|E|) O(1) O(|V| ⋅ |E|) O(|E|) O(1) O(|E|) Notation for asymptotic growth letter (theta) Θ (big-oh) O (small-oh) o (big omega) Ω (small omega) ω bound upper and lower. tight[1] upper. while Omega is the lower bound.com .SO [2] f(x)=Θ(g(n)) means f (the running time of the algorithm) grows exactly like g when n (input size) gets larger. not tight growth equal[2] less than or equal[3] less than greater than or equal greater than [1] Big O is the upper bound. In other words. big-oh is the most useful because represents the worstcase behavior. An algorithm taking Theta(n log n) is far preferential since it takes AT LEAST n log n (Omega n log n) and NO MORE THAN n log n (Big O n log n). tightness unknown lower. not tight lower.

Google Calendar.com/apps/business Get Gmail for Business. Google Docs and more! Big-O Complexity Chart This interactive chart.google. while O(1) is the best complexity.In short. which only requires a constant number of operations for any number of elements. if algorithm is __ then its performance is __ algorithm o(n) O(n) Θ(n) Ω(n) ω(n) performance <n ≤n =n ≥n >n Google Apps for Business www.com . open in browser PRO version Are you a developer? Try out the HTML to PDF API pdfcrowd. O(n!) is the worst complexity which requires 720 operations for just 6 elements. shows the number of operations (y axis) required to obtain a result as the number of elements (x axis) increase. created by our friends over at MeteorCharts.

5. Eric Rowell Quentin Pleple Nick Dizazzo Michael Abed Adam Forsyth Are you a developer? Try out the HTML to PDF API open in browser PRO version pdfcrowd. 3.Contributors Edit these tables! 1.com . 4. 2.

8. 12. Jay Engineer Josh Davis makosblade Alejandro Ramirez Joel Friedly Robert Burke David Dorfman Eric Lefevre-Ardant Thomas Dybdahl Ahle AROUND THE WEB What the Bible Says About Money (Shocking) Moneynews Malcolm Gladwell answers questions about Competing in Today's … OPEN Forum The Best Pizza in Every State: 50 Amazing Pies Across America Zagat Want to Declutter Your Desk: Here's the Ultimate Way to Do It My Life Scoop Avoid These 10 Jobs: They Have No Future Kiplinger.com Decking Your Apartment for the Holidays Remodelista Sex: The Best Painkiller and Cancer Preventer Daily Health Post 148 comments Join the discussion… Best Community Michael Mitchell • 7 months ago Share This is great. 9.What Parents Need to Watch For iVillage. 10.6. 14. 13. mooc etc) that would explain each open in browser PRO version pdfcrowd. 7.com "Dry Drowning" Claims Life of 10-Year-Old .com . Maybe you could include some Are you a developer? Try out the HTML to PDF API resources (links to khan academy. 11.

com/course.org/courses/algor..-) • Reply • Share › Gokce Toykuyu • a year ago open in browser PRO version Are you a developer? Try out the HTML to PDF API pdfcrowd.edu/courses/ele. https://www..s. http://ocw. Maybe you could include some resources (links to khan academy..... #2) http://ocw. mooc etc) that would explain each of these concepts for people trying to learn them.mit. Sincerely..com . #1) http://aduni. but I have not had a chance to look at it.org/cours. 3 • Reply • Share › fireheron Arjan Nieuwenhuizen • 2 months ago Thank you Arjan.. This course has just begun on coursera (dated 1 July 2013). Espaecially the coursera.udacity.This is great.edu/courses/ele. and looks very good.org one .. 119 • Reply • Share › Amanda Harlin 34 Cam Tyler 9 Michael Mitchell • 7 months ago Yes! Please & thank you • Reply • Share › Michael Mitchell • 6 months ago This explanation in 'plain English' helps: http://stackoverflow..mit. #3) https://www. • Reply • Share › Arjan Nieuwenhuizen Michael Mitchell • 5 months ago Here are the links that I know of. probably as good or maybe better # 2. Arjan p.com/quest.coursera...

22 • Reply • Share › Jon Renner 30 1 • 7 months ago This is god's work.Gokce Toykuyu 29 • a year ago Could we add some tree algorithms and complexities? Thanks. But I love the fact there are people out there this clever. and cross platform compatible. ". I really like the Red-Black trees . • Reply • Share › Adam Heinermann 19 • 6 months ago Is there a printer-friendly version? • Reply • Share › qwertykeyboard 14 • 7 months ago It would be very helpful to have export to PDF. and search complexities for specific data structures 23 Darren Le Redgatr • Reply • Share › • 7 months ago I came here from an idle twitter click. It might take you a long time to get it working. Thx • Reply • Share › Gene qwertykeyboard • a month ago You could convert the document yourself using Pandoc: http://johnmacfarlane..) • Reply • Share › ericdrowell Mod Gokce Toykuyu • a year ago Excellent idea. Cheers.com . 1 • Reply • Share › open in browser PRO version Are you a developer? Try out the HTML to PDF API pdfcrowd. If I understand big oh notation correctly I might say "I estimate your learning rate for learning Pandoc will be O(1). but Pandoc is an amazing one stop shop for file conversion.net/pand. Makes me think that one day humanity will come good.. I have no idea what it's talking about or any of the comments. deletion. I'll add a section that compares insertion.

how much does it take to delete it?". and upper bound. not average case. worst and average) cases. Deletion/insertion in a single linked list is implementation dependent. This should have been shared a week ago! Would have saved me like 45 minutes of using Wikipedia. 3. single-linked lists take O(N) since you have to search for the element that points to the element being deleted.. Big O cannot be used for lower. However with a good distribution function they are O(logN) worst case. 13 Guest • Reply • Share › • 7 months ago Finals are already over. It is the upper bound for for the Are you a developer? Try out the HTML to PDF API pdfcrowd. the table should probably also contain heaps and the complexities for the operation "Get Minimum".. you end up with a worst case of O(loglogN). 9 • Reply • Share › Blake Jennings 8 tempire • 7 months ago i'm literally crying • Reply • Share › • 7 months ago This chart seems misleading. For trees.. Am I wrong? Luis 2 guest • 7 months ago • Reply • Share › You are right. Big O is worst case. ~ is average case.Valentin Stanciu • 7 months ago 1. 11 1 guest 6 • Reply • Share › tempire • 7 months ago • Reply • Share › I think big O is just an upper bound. Oleksandr Luis • 2 months ago open in browser PRO version @Luis That is WRONG..) shouldn't be used in the average case columns. Big O (Omicron) is the Worst Case Scenario.com . Using a double hashing algorithm. average. Double-linked lists solve this problem. It could be used for all (best. @tempire is correct. 2.. For the question of "Here's a pointer to an element. Hashes come in a million varieties. O(.

This is almost pointless to have. You can usually find that average for an algorithms efficiency by testing it in average case and worst cases together. With this in mind. There is another problem I do not like is the color scheme is sometimes wrong. 135 dollars to get to New York. To be more appropriate. This is the most beneficially piece of information to have about an algorithm but unfortunately it is usually very hard to find. As the size of the problem grows (the array to be searched grows in size). your example should be modified to say something like "it takes at most 2$ per mile" (linear).com . you can thus understand how big O can be used both for. for instance you would rather have Big O then Omega because it is exactly the same as say "it will take more than five dollars to get to N. open in browser PRO version Are you a developer? Try out the HTML to PDF API pdfcrowd. Big O (Omicron) is the Worst Case Scenario." The first bit of information from Omega is essentially useless. It is the upper bound for for the algorithm. while the worst case (the object is in the last index where we look) has an upper time bound of O(n) (it takes a number of steps of order equal to the problem size. say. vs. i. or another fixed position). • Reply • Share › Oleksandr1 Luis • a month ago You make a very poor assumption that because a specific value is given.. Simply this is a computational exercise to extract the empirical data. worst case is when the list is completed out of order. the list sorted but backwards. etc. but big O and related concepts are used to bound the order (linear. at most. the best case still has an upper time bound of O(1) (it takes constant time to find an element in index 0. However. O(n) is better the O(log(n))? In what way? 1024 vs 10 increments that a sort algorithm has to perform for instance? All in all this is good information but in its current state. Theta is the upper and lower bound together.) with problem size. time. but we have done this. until we find the object in the last index where we look. For instance in a linear search algorithm. Omega is the lower bound. Its will always take. this is in MHO so if I'm off base or incorrect then feel free to flame me like the fantastic four at a gay parade :) • Reply • Share › Luis Oleksandr • 2 months ago @Oleksandr You are confused. Take your linear search.g..Y.upper bound.). n. the best and the worst case. exponential.) of a function that describes how an algorithm grows (in space. Your example about the dollars states specific amounts (e. " at most 135 dollars"). to the novice. etc.e. honestly it needs to be taken with a grain of salt and fact check with a good algorithm book. the third however gives you the constraint.

Big O cannot be used for the best case scenario. Given function unknown. there are three different statements in this argument. but backwards. I agree with Luis that the table is correct and not useless but also agree with Oleksandr that it's not complete (but again disagree that it is incomplete because of the mismatch between best/average case and big-O. I • Reply • Share › see more Yavuz Yetim Oleksandr1 • a month ago @Oleksandr @Luis IMHO. For example.. this is a complete misunderstanding of Omega vs Omicron. This statement is open in browser PRO version Are you a developer? Try out the HTML to PDF API pdfcrowd. BUT it will never run more than 135 iterations. each useful for a different use case. and do not have any relation with each other. You should read up on this because this is very important. you have a lower-bound for average-case. see Statement iii and Example (a) in the end). that lead to the eventual misunderstanding. or any such number I specify to be used in the example. 135 being the Omicron value. It is in fact any polynomial function of my choice given its parameters and any amount of Lagrange constants which will produce a value of 135. The point is that Big O is the upper bound of a function. These are orthogonal terms. I agree about what you said about linear search algorithm. $5 was the Omega value. but for you I change situation and values. (in total 9 different.has useless/meaningless information) Here are the statements in this argument: Statement i) "The table is wrong in using Big-O notation for all columns". The main confusion is between the terms "case" and "bound"..com . I meant to say Linear Sort Algorithm.than it must be a linear function. As for the example. . which has the worst can scenario when a list is fed to said algorithm in order. On the linear search algorithm. or upper-bound for best-case. In fact there are an infinite amount of Big O's for any elementary functions. correct combinations. $135 dollars was given as an upper bound. I'm not sure why you don't understand a very clear analogy. forgive me. but --none-. it will run more than five iterations (Omega).

the best and the worst case. see more • Reply • Share › Guest Oleksandr • 2 months ago @Oleksandr You are confused. " at most 135 dollars"). Big-O notation is only a representation for a function. the best case still has an upper time bound of O(1) (it takes constant time to find an element in index 0. With this in mind.Statement i) "The table is wrong in using Big-O notation for all columns". Therefore. etc. average case or the best case. Thanks! • Reply • Share › • 7 months ago I think DFS and BFS. n. would be more appropriate listed as Graph instead of Tree. writing O(n) for a best-case entry is correct. until we find the object in the last index where we look. while the worst case (the object is in the last index where we look) has an upper time bound of O(n) (it takes a number of steps of order equal to the problem size. Take your linear search. under Search. etc. but big O and related concepts are used to bound the order (linear. One correct representation for this function is O(n). (fixed: wrong autocomplete of who I replied to) • Reply • Share › ericdrowell 1 Antoine Grondin 7 Mod tempire • 7 months ago I'll try to clarify that.) of a function that describes how an algorithm grows (in space. Big-O notation does not have anything to do with the worst case. or another fixed position).g.). Let's say the best-case run time for an algorithm for a given input of size n is exactly (3*n + 1). your example should be modified to say something like "it takes at most 2$ per mile" (linear). • Reply • Share › open in browser PRO version Are you a developer? Try out the HTML to PDF API pdfcrowd. To be more appropriate.com .) with problem size. As the size of the problem grows (the array to be searched grows in size). exponential. say. time. This statement is false because the table is correct. Your example about the dollars states specific amounts (e. you can thus understand how big O can be used both for.

4 • Reply • Share › Marten Czech 1 Jon Renner 5 • 5 months ago Marcus • 2 months ago IT world ticks in English. • Reply • Share › Are you a developer? Try out the HTML to PDF API pdfcrowd. should I translate it on another website or you can support localisation and I do the data entering for french? I'm interested! 9 1 • Reply • Share › Marten Czech Stephane Duguay • 7 months ago learn English! 19 9 • Reply • Share › Marcus Marten Czech • 2 months ago Maybe he means he wants to deliver it to French students. I'd like to use a french version of this page in class.. Don't be ignorant. there is no reason that everything should be in English.ericdrowell 3 Mod Antoine Grondin • 7 months ago Fixed! Thanks • Reply • Share › Quentin Pleplé Antoine Grondin • 7 months ago Agreed • Reply • Share › Stephane Duguay • 7 months ago Hi..com . Looks nicer IMHO. • Reply • Share › Anyway I can get a PDF version without taking screenshots myself? • Reply • Share › Anonimancio Cobardoso 5 open in browser PRO version • 7 months ago You could include a chart with logarithmic scale. If he is offering to do the data entry from french. the sooner French realize that the faster we can go together. but clearly speaks English (from his comment).

you must talk about some specific algorithm.. Might mention SAT and related problems in NP-complete where the best known algorithm for a problem of size n has O(2^n). am I wrong? Does anybody just learns the paris algorithm_name : complexity.com . e.g.5 • Reply • Share › sigmaalgebra • 7 months ago You omitted an in-place. but not the whole alogrithm. 5 • Reply • Share › IvanKuckir • 7 months ago Do you really find this useful? When talking about complexity. I am still a student. 5 • Reply • Share › Gábor Nádai • 7 months ago Nice. And I think. you already know the complexity. there is something wrong with that company. But when you know the algorithm. 4 • Reply • Share › ericdrowell 3 Mod IvanKuckir • 7 months ago have you never had a technical interview before? • Reply • Share › IvanKuckir ericdrowell • 7 months ago No. precise definition of O(). heap sort. that if employer wants you to know just algorithm complexity.. guaranteed O(n log(n)) array sort.... Might include an actual. You omitted radix sort that can be faster than any of the algorithms you mentioned. open in browser PRO version Are you a developer? Try out the HTML to PDF API pdfcrowd. without any idea how algorithm works? OMG.

it has complexity around n^2. Both of them are interested in basic tree/graph and sorting algorithms and give you one or two puzzles that don't really help in real life. aren't you? :) I have implemented Strassen Algorithm once. complexity is not always apparent. Also. 2 chriswashere818 • Reply • Share › IvanKuckir • 7 months ago I don't know every algorithm out there. just because certain companies are asking algorithms. Certain people will never use algorithms above tree search or sorting. I don't know all of them. Most of the top companies I know of don't even go with Red-Black tree. how is that obvious? 2 • Reply • Share › IvanKuckir chriswashere818 • 7 months ago You are probably talking about some fast matrix multiplication.8. because I am on the hardware side of computer science. including some of these. So yes.836) . this fact does not imply other companies have a lower expectation. I've worked with algorithms that are O(n^2.com . They might not even need streaming algorithm. • Reply • Share › Awesome You should add Are youresource! a developer? Try out the HTML toDijkstra PDF API using a Fibonacci Heap! open in browser PRO version pdfcrowd. 2 • Reply • Share › chriswashere818 1 Ankush Gupta • 7 months ago IvanKuckir • 7 months ago Yes. but the other half are puzzles that I find (and certainly a lot of people) less helpful . and therefore. One I find useful one is fitting GBs of data into 1M memory if I remember correctly...1 • Reply • Share › Yeukhon Wong IvanKuckir • 7 months ago That's too strong. Also. Half of the Google interview questions are good. even though I know some of these. that's the one. There are simply too many algorithms.. I found it useful. Anyway.. not everyone will remember the complexity.

Thank you! • Reply • Share › Mohamed Shimran • 6 months ago This is damn great :) Ultimate programming tutorials 2 ct01 2 • Reply • Share › • 7 months ago Why is space complexity O(|V|) "good" in some cases and "fair" in others? • Reply • Share › soulmachine • 7 months ago awesome! 2 Nir Alfasi 2 • Reply • Share › • 7 months ago Complexity forBFS/DFS is O(|V| + |E|).com . Thank you. • Reply • Share › • 4 months ago Extremely useful and on an easy to remember URL. since we're traversing each node/edge only once.Awesome resource! You should add Dijkstra using a Fibonacci Heap! 3 AmitK 3 maxw3st 3 Nikola 2 • Reply • Share › • 7 months ago Its pretty handy! • Reply • Share › • a year ago This gives me some excellent homework to do of a variety I'm not getting in classes. Good job! • Reply • Share › open in browser PRO version Are you a developer? Try out the HTML to PDF API pdfcrowd.

google. Google Docs and more! Page styling via Bootstrap Comments via Disqus Algorithm detail via Wikipedia Big-O complexity chart via MeteorCharts Table source hosted on Github Mashup via @ericdrowell open in browser PRO version Are you a developer? Try out the HTML to PDF API pdfcrowd.Load more comments Subscribe Add Disqus to your site Google Apps for Business www. Google Calendar.com .com/apps/business Get Gmail for Business.

Sign up to vote on this title
UsefulNot useful