Big O is a notoriously huge part of any software engineering interview. Knowing Big O demonstrates a knowledge of the actual complexity and performance of an algorithm you are writing or reviewing.
Perhaps most relevant is the Big O of common operations in well-used data structures.
Big O is also useful in describing the space and time complexity of sorting algorithms.
That’s all for now! More interview-related notes to come.
1 thought on “The Dreaded Big O”
Hi there! Such a wonderful article, thank you!
Comments are closed.