Month: June 2017

  • O(n!)

    Learning data structures and algorithms can be tricky; memorizing what O(n) means is one thing, actually knowing it such that you intuitively understand its meaning, i.e., can see what it means, is another. Along these lines, I will here discuss how I see O(n!). O(n!) says that an algorithm’s work will increase with relation to input size n […]