This is the repostitory of all the algorithms problems that I will encounter during my journey to the mastery of algorithms.
"Life sucks."
- Cut the cheese
- Slice the tomatoes
- Rub the tomatoes in flour
- Flour
- Cheese
- Tomatoes
- Tintin
- A reporter
- Has poofy orange hair
- Friends with the world's most awesome dog
- Haddock
- A sea captain
- Has a fantastic beard
- Loves whiskey
- Possibly also scotch?
- Cut the cheese
Make sure that the cheese is cut into little triangles.
- Slice the tomatoes
Be careful when holding the knife.
For more help on tomato slicing, see Thomas Jefferson's seminal essay Tom Ate Those.
We pictured the meek mild creatures where
They dwelt in their strawy pen,
Nor did it occur to one of us there
To doubt they were kneeling then.
For any two functions f(n) and g(n), we have f(n) = Θ(g(n)) if and only if f(n) = O(g(n)) and f(n) = Ω(g(n)).
Time complexity of all computer algorithms can be written as Ω(1)
For any two functions f(n) and g(n), we have f(n) = Θ(g(n)) if and only if f(n) = O(g(n)) and f(n) = Ω(g(n)).
Time complexity of all computer algorithms can be written as Ω(1)