About this document
Lect 08 by nyirendadeborah175 is a document available to read on EtoBox.
The document discusses logarithmic running time in algorithms, focusing on binary search and efficient exponentiation methods. It explains that an algorithm is O(log n) if it reduces the problem size by a fraction, exemplified by binary search which halves the search space with each iteration. Additionally, it presents an efficient exponentiation function that achieves O(log n) time complexity through recursive calls and binary representation of the exponent.
- Author
- nyirendadeborah175
- Language
- EN