About this document
Chapter 3: Algorithm Fundamentals by Nguyen Ngoc Bao Han (K18 HCM) is a document available to read on EtoBox.
This document summarizes Chapter 3 on algorithms from the book. It introduces common algorithms like linear search, binary search, bubble sort, insertion sort, and greedy algorithms. It also covers algorithm analysis including big-O, big-Omega and big-Theta notations to determine the time complexity of algorithms. Examples are provided to illustrate how to analyze the complexity of functions and algorithms. The chapter discusses analyzing the time and space complexity of algorithms to determine their comput
- Author
- Nguyen Ngoc Bao Han (K18 HCM)
- Language
- EN