ro31337/bigoposter

Big-O Complexities / Poster of common algorithms used in Computer Science

bigoposter's Issues

Code

Could you please add the source code.

Quicksort is O(N) worst-case space complexity

Consider the case where every time you select a pivot, that pivot is either the minimal or maximal element. You allocate a fixed amount of storage and recurse N times. Common improvements to pivot selection (e.g. median of M) only improve this by a constant factor.

Credit

Looks like a copy of @ericdrowell's https://github.com/ericdrowell/BigOCheatSheet

Least you could do is give credit.

Missing queues

The poster is missing big O for queues

Can make a Dark Themed Variant

use human/printer friendly color palette

It's hard to distinguish the dark/medium greens used for the Excellent/Good labels. 👀 See ColorBrewer2.

Max of Linked List (Sorted)

In the "Heap" section, it is stated that finding the maximum value of a "Linked List (Sorted)" is O(1).

However, this is only the case for a Doubly Linked List, because to find the maximum in a sorted Singly Linked-List array, you'd have to walk the entire list, which makes it O(N).

Clarifying that it's a Doubly Linked List would probably fix this best.

Ransoming Stars ?

It seems harmful to the git hub community to ransom stars ? If your going to make it MIT, then do it, if not why not put it somewhere else other then git hub ? Git hubs greatest tool is the ability to fork, merge, and grow the work. Also, something like this would be better as creative common, as oppose to MIT..

It really does look like your just copying @ericdrowell work