About this document
Understanding Algorithms and Complexity by Pranay Anand is a document available to read on EtoBox.
An algorithm is a step-by-step procedure for solving a problem in a finite amount of time. It must have definite inputs and outputs, be finite, and produce correct outputs. Examples provided include linear search, binary search, bubble sort, and analysis of their inputs, outputs, and operations. Asymptotic notation like Big-O, Big-Omega, and Theta are introduced to classify functions by their growth rates, ignoring constant factors and lower order terms.
- Author
- Pranay Anand
- Language
- EN