Data Structures and Algorithm

이 룰렛의 항목 (5개)

• What is Big-O notation? Explain O(1), O(n), O(logn), O(n^2)
• Difference between Big-O, Big-Omega, Big-Tetta
• Why is logarithmic time complexity common in binary search and tree operations?
• What is amortized analysis? Example with dynamic arrays(List<T> in .NET)
• How does garbage collection affect time complexity in C#?