Computational Complexity (2023)
3 points by samuelhautamaki
3 points by samuelhautamaki
This essay explores Computational Complexity, most notably the growth of functions with Big-Oh notation, this essay also includes graphical demonstrations of different types of complex functions represented as mathematical functions.
Searching an arbitrary binary tree is O(n), not O(log n). Did you mean to restrict this section to balanced binary trees?
Back in 2023, my maths teacher assigned for students to write an investigation of something, and produce an essay for it. I decided to write about big O notation, and I guess here's my essay. Only minor changes (in the abstract) and author sections since I submitted this essay in 2023.