Status Updates From Grokking Algorithms An Illu...
Grokking Algorithms An Illustrated Guide For Programmers and Other Curious People by
Status Updates Showing 2,881-2,910 of 5,051
Sophie
is on page 16 of 256
Four main takeaways before ch. 4:
1. Run time of algorithms is expressed in Big O notation.
2. Algorithm speed is measured in growth of the number of operations, not in seconds.
3. As the size of the input increases, the run time of an algorithm increases super quick.
4. O(log n) is faster than O(n), and it gets way faster as the list of items grows.
— Aug 27, 2021 05:26PM
Add a comment
1. Run time of algorithms is expressed in Big O notation.
2. Algorithm speed is measured in growth of the number of operations, not in seconds.
3. As the size of the input increases, the run time of an algorithm increases super quick.
4. O(log n) is faster than O(n), and it gets way faster as the list of items grows.
Sophie
is on page 8 of 256
Binary search only works when your list is in sorted order.
— Aug 23, 2021 02:51PM
Add a comment
Sophie
is starting
An algorithm is a set of instructions for accomplishing a task. Every piece of code could be called an algorithm.
— Aug 23, 2021 01:36PM
Add a comment
