Big-O Algorithm Complexity Cheat Sheet

Post by omershapira » Sat, May 04, 2013, 3:43 PM UTC

vault_ wrote: post #9

This is a pretty limited list of algorithms. It should definitely include linear time sorting algorithms (e.g. bucket or radix sort), as well as graph algorithms (shortest path at least, but also probably all pair shortest path and minimum spanning tree). There should also be a section about heaps and their operations. There are a huge number of ways to implement a heap (e.g. linked list, binary tree, or a more exoti…

Post by nutjob123 » Sat, May 04, 2013, 3:43 PM UTC

wting wrote: post #4

You can pass some interviews by blindly memorizing, but it's unnecessary. If you understand a concept, then you can reason its big O. Memorization implies a superficial understanding that may be revealed later. If you don't understand something, spend a few hours and implement it. "I hear and I forget. I see and I remember. I do and I understand." - Confucious

Post by fmax30 » Sat, May 04, 2013, 3:48 PM UTC

Post by fatemayasmine » Sat, May 04, 2013, 3:58 PM UTC

algorias wrote: post #6

This is why it's a terrible idea to ask for some random algorithm runtime in an interview. It says absolutely nothing about programming or reasoning skill. I'd rather ask a candidate to explain their favorite data structure to me and derive it's big-O complexity right then and there. Being able to regurgitate the correct answer doesn't count for anything in my book.

Post by kintamanimatt » Sat, May 04, 2013, 3:59 PM UTC

AYBABTME wrote: post #8

This is very shallow and of limited use.